./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 22:27:41,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:27:41,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:27:41,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:27:41,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:27:41,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:27:41,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:27:41,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:27:41,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:27:41,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:27:41,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:27:41,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:27:41,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:27:41,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:27:41,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:27:41,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:27:41,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:27:41,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:27:41,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:27:41,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:27:41,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:27:41,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:27:41,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:27:41,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:27:41,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:27:41,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:27:41,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:27:41,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:27:41,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:27:41,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:27:41,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:27:41,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:27:41,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:27:41,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:27:41,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:27:41,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:27:41,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:27:41,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:27:41,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:27:41,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:27:41,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:27:41,641 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 22:27:41,676 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:27:41,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:27:41,682 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:27:41,682 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:27:41,683 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:27:41,683 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:27:41,683 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:27:41,684 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:27:41,684 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:27:41,684 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:27:41,685 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:27:41,685 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:27:41,685 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:27:41,686 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:27:41,686 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:27:41,686 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:27:41,686 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:27:41,687 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:27:41,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:27:41,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:27:41,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:27:41,688 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:27:41,689 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:27:41,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:27:41,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:27:41,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:27:41,690 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:27:41,690 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:27:41,691 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:27:41,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:27:41,691 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:27:41,691 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:27:41,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:27:41,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:27:41,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:27:41,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:27:41,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:27:41,693 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:27:41,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:27:41,693 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:27:41,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:27:41,694 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:27:41,694 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_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/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_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 [2022-11-25 22:27:42,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:27:42,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:27:42,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:27:42,028 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:27:42,029 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:27:42,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i [2022-11-25 22:27:45,114 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:27:45,399 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:27:45,414 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i [2022-11-25 22:27:45,430 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/data/ea4f4dfdd/ad9a2a38512b4e3fb293066e0ef9bd41/FLAGa51cc3ff6 [2022-11-25 22:27:45,445 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/data/ea4f4dfdd/ad9a2a38512b4e3fb293066e0ef9bd41 [2022-11-25 22:27:45,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:27:45,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:27:45,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:27:45,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:27:45,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:27:45,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:27:45" (1/1) ... [2022-11-25 22:27:45,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2351e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:45, skipping insertion in model container [2022-11-25 22:27:45,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:27:45" (1/1) ... [2022-11-25 22:27:45,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:27:45,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:27:45,958 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i[33021,33034] [2022-11-25 22:27:46,171 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:27:46,183 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i[49681,49694] [2022-11-25 22:27:46,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:27:46,233 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-25 22:27:46,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4b7fcfd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:46, skipping insertion in model container [2022-11-25 22:27:46,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:27:46,235 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-25 22:27:46,237 INFO L158 Benchmark]: Toolchain (without parser) took 786.85ms. Allocated memory is still 148.9MB. Free memory was 105.0MB in the beginning and 81.6MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 22:27:46,238 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 148.9MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:27:46,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 784.55ms. Allocated memory is still 148.9MB. Free memory was 105.0MB in the beginning and 81.6MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 22:27:46,240 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.33ms. Allocated memory is still 148.9MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 784.55ms. Allocated memory is still 148.9MB. Free memory was 105.0MB in the beginning and 81.6MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 22:27:48,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:27:48,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:27:48,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:27:48,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:27:48,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:27:48,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:27:48,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:27:48,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:27:48,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:27:48,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:27:48,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:27:48,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:27:48,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:27:48,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:27:48,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:27:48,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:27:48,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:27:48,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:27:48,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:27:48,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:27:48,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:27:48,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:27:48,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:27:48,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:27:48,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:27:48,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:27:48,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:27:48,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:27:48,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:27:48,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:27:48,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:27:48,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:27:48,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:27:48,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:27:48,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:27:48,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:27:48,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:27:48,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:27:48,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:27:48,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:27:48,535 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-25 22:27:48,576 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:27:48,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:27:48,577 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:27:48,578 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:27:48,579 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:27:48,579 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:27:48,579 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:27:48,579 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:27:48,579 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:27:48,580 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:27:48,581 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:27:48,581 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:27:48,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:27:48,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:27:48,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:27:48,582 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:27:48,583 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:27:48,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:27:48,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:27:48,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:27:48,584 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:27:48,584 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:27:48,584 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:27:48,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:27:48,584 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:27:48,585 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 22:27:48,585 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 22:27:48,585 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:27:48,585 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:27:48,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:27:48,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 22:27:48,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:27:48,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:27:48,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:27:48,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:27:48,587 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 22:27:48,587 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 22:27:48,588 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:27:48,588 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 22:27:48,588 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_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/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_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 [2022-11-25 22:27:48,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:27:48,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:27:48,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:27:48,980 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:27:48,981 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:27:48,983 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i [2022-11-25 22:27:52,090 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:27:52,446 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:27:52,447 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i [2022-11-25 22:27:52,473 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/data/3040d824f/7226080c31944e628a7a46f2da07b3b1/FLAG84c47057b [2022-11-25 22:27:52,497 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/data/3040d824f/7226080c31944e628a7a46f2da07b3b1 [2022-11-25 22:27:52,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:27:52,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:27:52,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:27:52,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:27:52,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:27:52,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:27:52" (1/1) ... [2022-11-25 22:27:52,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@589bf1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:52, skipping insertion in model container [2022-11-25 22:27:52,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:27:52" (1/1) ... [2022-11-25 22:27:52,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:27:52,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:27:53,003 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i[33021,33034] [2022-11-25 22:27:53,171 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:27:53,186 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i[49681,49694] [2022-11-25 22:27:53,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:27:53,243 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 22:27:53,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:27:53,296 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i[33021,33034] [2022-11-25 22:27:53,415 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:27:53,431 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i[49681,49694] [2022-11-25 22:27:53,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:27:53,453 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:27:53,494 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i[33021,33034] [2022-11-25 22:27:53,538 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:27:53,540 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i[49681,49694] [2022-11-25 22:27:53,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:27:53,581 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:27:53,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:53 WrapperNode [2022-11-25 22:27:53,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:27:53,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:27:53,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:27:53,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:27:53,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:53" (1/1) ... [2022-11-25 22:27:53,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:53" (1/1) ... [2022-11-25 22:27:53,705 INFO L138 Inliner]: procedures = 180, calls = 439, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1570 [2022-11-25 22:27:53,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:27:53,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:27:53,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:27:53,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:27:53,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:53" (1/1) ... [2022-11-25 22:27:53,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:53" (1/1) ... [2022-11-25 22:27:53,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:53" (1/1) ... [2022-11-25 22:27:53,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:53" (1/1) ... [2022-11-25 22:27:53,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:53" (1/1) ... [2022-11-25 22:27:53,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:53" (1/1) ... [2022-11-25 22:27:53,822 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:53" (1/1) ... [2022-11-25 22:27:53,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:53" (1/1) ... [2022-11-25 22:27:53,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:27:53,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:27:53,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:27:53,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:27:53,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:53" (1/1) ... [2022-11-25 22:27:53,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:27:53,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:27:53,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:27:53,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:27:53,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-25 22:27:53,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 22:27:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 22:27:53,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 22:27:53,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-25 22:27:53,937 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-25 22:27:53,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 22:27:53,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:27:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 22:27:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:27:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-25 22:27:53,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 22:27:53,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:27:53,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 22:27:53,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 22:27:53,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:27:53,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:27:54,345 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:27:54,349 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:27:54,353 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 22:28:01,493 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:28:01,517 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:28:01,517 INFO L300 CfgBuilder]: Removed 92 assume(true) statements. [2022-11-25 22:28:01,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:28:01 BoogieIcfgContainer [2022-11-25 22:28:01,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:28:01,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:28:01,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:28:01,530 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:28:01,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:27:52" (1/3) ... [2022-11-25 22:28:01,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e7b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:28:01, skipping insertion in model container [2022-11-25 22:28:01,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:53" (2/3) ... [2022-11-25 22:28:01,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e7b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:28:01, skipping insertion in model container [2022-11-25 22:28:01,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:28:01" (3/3) ... [2022-11-25 22:28:01,533 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-2.i [2022-11-25 22:28:01,552 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:28:01,552 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 834 error locations. [2022-11-25 22:28:01,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:28:01,681 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@489c8732, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:28:01,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 834 error locations. [2022-11-25 22:28:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 1653 states, 811 states have (on average 2.249075215782984) internal successors, (1824), 1644 states have internal predecessors, (1824), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 22:28:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 22:28:01,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:01,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 22:28:01,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:01,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-11-25 22:28:01,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:01,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308994473] [2022-11-25 22:28:01,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:01,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:01,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:01,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:01,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 22:28:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:01,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 22:28:01,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:01,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:28:01,978 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:01,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308994473] [2022-11-25 22:28:01,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308994473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:01,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:01,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:28:01,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045902653] [2022-11-25 22:28:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:01,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 22:28:01,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:02,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 22:28:02,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 22:28:02,030 INFO L87 Difference]: Start difference. First operand has 1653 states, 811 states have (on average 2.249075215782984) internal successors, (1824), 1644 states have internal predecessors, (1824), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:02,122 INFO L93 Difference]: Finished difference Result 1635 states and 1727 transitions. [2022-11-25 22:28:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 22:28:02,125 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 22:28:02,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:02,148 INFO L225 Difference]: With dead ends: 1635 [2022-11-25 22:28:02,148 INFO L226 Difference]: Without dead ends: 1633 [2022-11-25 22:28:02,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 22:28:02,153 INFO L413 NwaCegarLoop]: 1727 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, 1727 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:02,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:28:02,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-11-25 22:28:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2022-11-25 22:28:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 802 states have (on average 2.123441396508728) internal successors, (1703), 1624 states have internal predecessors, (1703), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 22:28:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 1725 transitions. [2022-11-25 22:28:02,289 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 1725 transitions. Word has length 5 [2022-11-25 22:28:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:02,289 INFO L495 AbstractCegarLoop]: Abstraction has 1633 states and 1725 transitions. [2022-11-25 22:28:02,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 1725 transitions. [2022-11-25 22:28:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 22:28:02,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:02,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 22:28:02,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:02,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:02,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:02,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:02,503 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-11-25 22:28:02,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:02,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725992715] [2022-11-25 22:28:02,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:02,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:02,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:02,505 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:02,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 22:28:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:02,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:28:02,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:02,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:28:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:02,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:28:02,819 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:02,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725992715] [2022-11-25 22:28:02,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725992715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:02,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:02,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:28:02,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179082609] [2022-11-25 22:28:02,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:02,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:28:02,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:02,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:28:02,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:28:02,823 INFO L87 Difference]: Start difference. First operand 1633 states and 1725 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:06,608 INFO L93 Difference]: Finished difference Result 1889 states and 2024 transitions. [2022-11-25 22:28:06,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:28:06,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 22:28:06,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:06,615 INFO L225 Difference]: With dead ends: 1889 [2022-11-25 22:28:06,616 INFO L226 Difference]: Without dead ends: 1889 [2022-11-25 22:28:06,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:28:06,617 INFO L413 NwaCegarLoop]: 1164 mSDtfsCounter, 1365 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:06,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1529 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-25 22:28:06,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2022-11-25 22:28:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1618. [2022-11-25 22:28:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 878 states have (on average 1.989749430523918) internal successors, (1747), 1609 states have internal predecessors, (1747), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 22:28:06,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 1769 transitions. [2022-11-25 22:28:06,672 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 1769 transitions. Word has length 5 [2022-11-25 22:28:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:06,673 INFO L495 AbstractCegarLoop]: Abstraction has 1618 states and 1769 transitions. [2022-11-25 22:28:06,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1769 transitions. [2022-11-25 22:28:06,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 22:28:06,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:06,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 22:28:06,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:06,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:06,886 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:06,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:06,886 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-11-25 22:28:06,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:06,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031090939] [2022-11-25 22:28:06,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:06,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:06,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:06,889 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:06,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 22:28:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:07,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:28:07,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:07,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:28:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:07,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:28:07,094 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:07,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031090939] [2022-11-25 22:28:07,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031090939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:07,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:07,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:28:07,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757741817] [2022-11-25 22:28:07,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:07,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:28:07,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:07,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:28:07,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:28:07,100 INFO L87 Difference]: Start difference. First operand 1618 states and 1769 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:12,215 INFO L93 Difference]: Finished difference Result 2138 states and 2339 transitions. [2022-11-25 22:28:12,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:28:12,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 22:28:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:12,224 INFO L225 Difference]: With dead ends: 2138 [2022-11-25 22:28:12,225 INFO L226 Difference]: Without dead ends: 2138 [2022-11-25 22:28:12,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:28:12,229 INFO L413 NwaCegarLoop]: 1556 mSDtfsCounter, 741 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:12,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 2260 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-25 22:28:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2022-11-25 22:28:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1774. [2022-11-25 22:28:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1044 states have (on average 1.9664750957854407) internal successors, (2053), 1765 states have internal predecessors, (2053), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 22:28:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2075 transitions. [2022-11-25 22:28:12,280 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2075 transitions. Word has length 5 [2022-11-25 22:28:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:12,280 INFO L495 AbstractCegarLoop]: Abstraction has 1774 states and 2075 transitions. [2022-11-25 22:28:12,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2075 transitions. [2022-11-25 22:28:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 22:28:12,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:12,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 22:28:12,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:12,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:12,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:12,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1157590079, now seen corresponding path program 1 times [2022-11-25 22:28:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:12,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564321467] [2022-11-25 22:28:12,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:12,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:12,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:12,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:12,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 22:28:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:12,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 22:28:12,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:12,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:28:12,703 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:12,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564321467] [2022-11-25 22:28:12,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564321467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:12,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:12,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:28:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501412851] [2022-11-25 22:28:12,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:12,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:28:12,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:12,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:28:12,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:28:12,710 INFO L87 Difference]: Start difference. First operand 1774 states and 2075 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:12,869 INFO L93 Difference]: Finished difference Result 3332 states and 3923 transitions. [2022-11-25 22:28:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:28:12,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 22:28:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:12,889 INFO L225 Difference]: With dead ends: 3332 [2022-11-25 22:28:12,889 INFO L226 Difference]: Without dead ends: 3332 [2022-11-25 22:28:12,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:28:12,893 INFO L413 NwaCegarLoop]: 1903 mSDtfsCounter, 1373 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 3517 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:12,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 3517 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:28:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2022-11-25 22:28:12,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 1776. [2022-11-25 22:28:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1046 states have (on average 1.9646271510516253) internal successors, (2055), 1767 states have internal predecessors, (2055), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 22:28:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2077 transitions. [2022-11-25 22:28:12,953 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2077 transitions. Word has length 6 [2022-11-25 22:28:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:12,954 INFO L495 AbstractCegarLoop]: Abstraction has 1776 states and 2077 transitions. [2022-11-25 22:28:12,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2077 transitions. [2022-11-25 22:28:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:28:12,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:12,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:12,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:13,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:13,166 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:13,166 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-11-25 22:28:13,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:13,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525671447] [2022-11-25 22:28:13,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:13,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:13,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:13,172 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:13,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 22:28:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:13,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 22:28:13,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:13,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:28:13,391 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:13,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525671447] [2022-11-25 22:28:13,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525671447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:13,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:13,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:28:13,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125365713] [2022-11-25 22:28:13,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:13,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:28:13,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:13,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:28:13,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:28:13,393 INFO L87 Difference]: Start difference. First operand 1776 states and 2077 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:13,439 INFO L93 Difference]: Finished difference Result 1740 states and 2040 transitions. [2022-11-25 22:28:13,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:28:13,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 22:28:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:13,445 INFO L225 Difference]: With dead ends: 1740 [2022-11-25 22:28:13,445 INFO L226 Difference]: Without dead ends: 1740 [2022-11-25 22:28:13,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:28:13,446 INFO L413 NwaCegarLoop]: 1576 mSDtfsCounter, 1546 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:13,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 1604 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:28:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2022-11-25 22:28:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1734. [2022-11-25 22:28:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1028 states have (on average 1.9571984435797665) internal successors, (2012), 1725 states have internal predecessors, (2012), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 22:28:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2034 transitions. [2022-11-25 22:28:13,482 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2034 transitions. Word has length 11 [2022-11-25 22:28:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:13,482 INFO L495 AbstractCegarLoop]: Abstraction has 1734 states and 2034 transitions. [2022-11-25 22:28:13,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2034 transitions. [2022-11-25 22:28:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 22:28:13,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:13,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:13,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:13,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:13,696 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:13,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:13,696 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-11-25 22:28:13,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:13,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598937790] [2022-11-25 22:28:13,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:13,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:13,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:13,699 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:13,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 22:28:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:13,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:28:13,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:13,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:28:13,957 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:13,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598937790] [2022-11-25 22:28:13,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598937790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:13,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:13,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:28:13,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229933254] [2022-11-25 22:28:13,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:13,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:28:13,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:13,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:28:13,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:28:13,960 INFO L87 Difference]: Start difference. First operand 1734 states and 2034 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:14,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:14,058 INFO L93 Difference]: Finished difference Result 1719 states and 2012 transitions. [2022-11-25 22:28:14,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:28:14,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 22:28:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:14,066 INFO L225 Difference]: With dead ends: 1719 [2022-11-25 22:28:14,066 INFO L226 Difference]: Without dead ends: 1719 [2022-11-25 22:28:14,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:28:14,067 INFO L413 NwaCegarLoop]: 1531 mSDtfsCounter, 1527 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 3083 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:14,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 3083 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:28:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2022-11-25 22:28:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1712. [2022-11-25 22:28:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1020 states have (on average 1.9441176470588235) internal successors, (1983), 1703 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) [2022-11-25 22:28:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2005 transitions. [2022-11-25 22:28:14,104 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2005 transitions. Word has length 13 [2022-11-25 22:28:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:14,104 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 2005 transitions. [2022-11-25 22:28:14,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2005 transitions. [2022-11-25 22:28:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 22:28:14,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:14,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:14,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:14,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:14,318 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:14,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:14,319 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-11-25 22:28:14,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:14,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403318131] [2022-11-25 22:28:14,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:14,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:14,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:14,324 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:14,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 22:28:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:14,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:28:14,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:14,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:28:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:14,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:28:14,665 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:14,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403318131] [2022-11-25 22:28:14,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403318131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:14,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:14,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:28:14,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645273142] [2022-11-25 22:28:14,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:14,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:28:14,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:14,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:28:14,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:28:14,668 INFO L87 Difference]: Start difference. First operand 1712 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) [2022-11-25 22:28:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:19,916 INFO L93 Difference]: Finished difference Result 2756 states and 3086 transitions. [2022-11-25 22:28:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:28:19,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 22:28:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:19,923 INFO L225 Difference]: With dead ends: 2756 [2022-11-25 22:28:19,923 INFO L226 Difference]: Without dead ends: 2756 [2022-11-25 22:28:19,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:28:19,924 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 3196 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3204 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:19,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3204 Valid, 1880 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-25 22:28:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2022-11-25 22:28:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 1708. [2022-11-25 22:28:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1020 states have (on average 1.9401960784313725) internal successors, (1979), 1699 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) [2022-11-25 22:28:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2001 transitions. [2022-11-25 22:28:19,960 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2001 transitions. Word has length 27 [2022-11-25 22:28:19,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:19,960 INFO L495 AbstractCegarLoop]: Abstraction has 1708 states and 2001 transitions. [2022-11-25 22:28:19,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:19,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2001 transitions. [2022-11-25 22:28:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 22:28:19,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:19,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:19,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:20,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:20,173 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:20,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:20,174 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-11-25 22:28:20,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:20,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794029972] [2022-11-25 22:28:20,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:20,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:20,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:20,176 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:20,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 22:28:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:20,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:28:20,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:20,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:28:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:20,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:28:20,593 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:20,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794029972] [2022-11-25 22:28:20,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794029972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:20,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:20,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:28:20,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609145559] [2022-11-25 22:28:20,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:20,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:28:20,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:20,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:28:20,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:28:20,595 INFO L87 Difference]: Start difference. First operand 1708 states and 2001 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:26,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:26,903 INFO L93 Difference]: Finished difference Result 2276 states and 2479 transitions. [2022-11-25 22:28:26,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:28:26,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 22:28:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:26,908 INFO L225 Difference]: With dead ends: 2276 [2022-11-25 22:28:26,908 INFO L226 Difference]: Without dead ends: 2276 [2022-11-25 22:28:26,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:28:26,908 INFO L413 NwaCegarLoop]: 1174 mSDtfsCounter, 1501 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 2591 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:26,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 2591 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-25 22:28:26,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2022-11-25 22:28:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1704. [2022-11-25 22:28:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1020 states have (on average 1.9362745098039216) internal successors, (1975), 1695 states have internal predecessors, (1975), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 22:28:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 1997 transitions. [2022-11-25 22:28:26,941 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 1997 transitions. Word has length 27 [2022-11-25 22:28:26,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:26,941 INFO L495 AbstractCegarLoop]: Abstraction has 1704 states and 1997 transitions. [2022-11-25 22:28:26,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 1997 transitions. [2022-11-25 22:28:26,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 22:28:26,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:26,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:26,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:27,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:27,155 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:27,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:27,156 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-11-25 22:28:27,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:27,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141589368] [2022-11-25 22:28:27,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:27,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:27,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:27,158 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:27,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 22:28:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:27,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:28:27,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:27,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:28:27,445 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:27,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141589368] [2022-11-25 22:28:27,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141589368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:27,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:27,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:28:27,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890456905] [2022-11-25 22:28:27,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:27,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:28:27,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:27,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:28:27,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:28:27,447 INFO L87 Difference]: Start difference. First operand 1704 states and 1997 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:27,549 INFO L93 Difference]: Finished difference Result 1704 states and 1993 transitions. [2022-11-25 22:28:27,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:28:27,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-25 22:28:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:27,555 INFO L225 Difference]: With dead ends: 1704 [2022-11-25 22:28:27,555 INFO L226 Difference]: Without dead ends: 1704 [2022-11-25 22:28:27,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:28:27,558 INFO L413 NwaCegarLoop]: 1525 mSDtfsCounter, 1496 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:27,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 3061 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:28:27,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2022-11-25 22:28:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1698. [2022-11-25 22:28:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1014 states have (on average 1.9378698224852071) internal successors, (1965), 1689 states have internal predecessors, (1965), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 22:28:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 1987 transitions. [2022-11-25 22:28:27,587 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 1987 transitions. Word has length 42 [2022-11-25 22:28:27,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:27,588 INFO L495 AbstractCegarLoop]: Abstraction has 1698 states and 1987 transitions. [2022-11-25 22:28:27,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 1987 transitions. [2022-11-25 22:28:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 22:28:27,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:27,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:27,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:27,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:27,806 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-11-25 22:28:27,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:27,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903100455] [2022-11-25 22:28:27,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:27,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:27,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:27,814 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:27,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 22:28:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:28,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:28:28,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:28,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:28:28,372 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:28,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903100455] [2022-11-25 22:28:28,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903100455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:28,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:28,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:28:28,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093212547] [2022-11-25 22:28:28,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:28,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:28:28,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:28,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:28:28,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:28:28,374 INFO L87 Difference]: Start difference. First operand 1698 states and 1987 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:28,615 INFO L93 Difference]: Finished difference Result 1939 states and 2237 transitions. [2022-11-25 22:28:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:28:28,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-11-25 22:28:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:28,622 INFO L225 Difference]: With dead ends: 1939 [2022-11-25 22:28:28,622 INFO L226 Difference]: Without dead ends: 1939 [2022-11-25 22:28:28,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:28:28,623 INFO L413 NwaCegarLoop]: 1604 mSDtfsCounter, 269 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 3004 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 [2022-11-25 22:28:28,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 3004 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:28:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2022-11-25 22:28:28,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1744. [2022-11-25 22:28:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1060 states have (on average 1.8971698113207547) internal successors, (2011), 1735 states have internal predecessors, (2011), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 22:28:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2033 transitions. [2022-11-25 22:28:28,650 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2033 transitions. Word has length 50 [2022-11-25 22:28:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:28,651 INFO L495 AbstractCegarLoop]: Abstraction has 1744 states and 2033 transitions. [2022-11-25 22:28:28,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2033 transitions. [2022-11-25 22:28:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 22:28:28,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:28,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:28,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:28,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:28,866 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:28,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-11-25 22:28:28,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:28,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020667927] [2022-11-25 22:28:28,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:28,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:28,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:28,868 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:28,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 22:28:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:29,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:28:29,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:29,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:28:29,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:28:29,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:28:29,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:28:29,815 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:28:29,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:28:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:29,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:28:29,843 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:29,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020667927] [2022-11-25 22:28:29,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020667927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:29,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:29,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:28:29,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414080542] [2022-11-25 22:28:29,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:29,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:28:29,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:29,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:28:29,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:28:29,845 INFO L87 Difference]: Start difference. First operand 1744 states and 2033 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:34,437 INFO L93 Difference]: Finished difference Result 1931 states and 2204 transitions. [2022-11-25 22:28:34,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:28:34,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-11-25 22:28:34,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:34,444 INFO L225 Difference]: With dead ends: 1931 [2022-11-25 22:28:34,444 INFO L226 Difference]: Without dead ends: 1931 [2022-11-25 22:28:34,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:28:34,447 INFO L413 NwaCegarLoop]: 627 mSDtfsCounter, 2660 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2676 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:34,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2676 Valid, 920 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-25 22:28:34,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-11-25 22:28:34,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1494. [2022-11-25 22:28:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 894 states have (on average 1.8008948545861299) internal successors, (1610), 1485 states have internal predecessors, (1610), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 22:28:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1632 transitions. [2022-11-25 22:28:34,474 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1632 transitions. Word has length 53 [2022-11-25 22:28:34,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:34,474 INFO L495 AbstractCegarLoop]: Abstraction has 1494 states and 1632 transitions. [2022-11-25 22:28:34,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1632 transitions. [2022-11-25 22:28:34,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 22:28:34,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:34,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:34,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-11-25 22:28:34,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:34,693 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:34,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:34,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-11-25 22:28:34,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:34,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661002117] [2022-11-25 22:28:34,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:34,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:34,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:34,697 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:34,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 22:28:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:35,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 22:28:35,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:35,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:28:35,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:28:35,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-25 22:28:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:35,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:28:35,110 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:35,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661002117] [2022-11-25 22:28:35,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661002117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:35,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:35,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:28:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670033030] [2022-11-25 22:28:35,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:35,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:28:35,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:35,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:28:35,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:28:35,115 INFO L87 Difference]: Start difference. First operand 1494 states and 1632 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:39,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:39,718 INFO L93 Difference]: Finished difference Result 1493 states and 1631 transitions. [2022-11-25 22:28:39,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:28:39,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 22:28:39,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:39,724 INFO L225 Difference]: With dead ends: 1493 [2022-11-25 22:28:39,724 INFO L226 Difference]: Without dead ends: 1493 [2022-11-25 22:28:39,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:28:39,725 INFO L413 NwaCegarLoop]: 1445 mSDtfsCounter, 4 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3688 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:39,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3688 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2097 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-25 22:28:39,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2022-11-25 22:28:39,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1493. [2022-11-25 22:28:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 894 states have (on average 1.7997762863534676) internal successors, (1609), 1484 states have internal predecessors, (1609), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 22:28:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1631 transitions. [2022-11-25 22:28:39,747 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1631 transitions. Word has length 58 [2022-11-25 22:28:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:39,747 INFO L495 AbstractCegarLoop]: Abstraction has 1493 states and 1631 transitions. [2022-11-25 22:28:39,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1631 transitions. [2022-11-25 22:28:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 22:28:39,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:39,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:39,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:39,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:39,963 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:39,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:39,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-11-25 22:28:39,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:39,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123372354] [2022-11-25 22:28:39,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:39,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:39,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:39,966 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:40,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-25 22:28:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:40,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 22:28:40,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:40,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:28:40,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:28:40,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:28:40,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-25 22:28:40,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:28:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:40,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:28:40,488 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:40,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123372354] [2022-11-25 22:28:40,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123372354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:40,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:40,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:28:40,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264428758] [2022-11-25 22:28:40,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:40,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:28:40,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:40,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:28:40,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:28:40,490 INFO L87 Difference]: Start difference. First operand 1493 states and 1631 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:46,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:46,653 INFO L93 Difference]: Finished difference Result 1492 states and 1630 transitions. [2022-11-25 22:28:46,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:28:46,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 22:28:46,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:46,658 INFO L225 Difference]: With dead ends: 1492 [2022-11-25 22:28:46,658 INFO L226 Difference]: Without dead ends: 1492 [2022-11-25 22:28:46,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:28:46,660 INFO L413 NwaCegarLoop]: 1445 mSDtfsCounter, 2 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3734 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:46,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3734 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-11-25 22:28:46,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2022-11-25 22:28:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2022-11-25 22:28:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 893 states have (on average 1.8006718924972005) internal successors, (1608), 1483 states have internal predecessors, (1608), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 22:28:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1630 transitions. [2022-11-25 22:28:46,681 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1630 transitions. Word has length 58 [2022-11-25 22:28:46,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:46,681 INFO L495 AbstractCegarLoop]: Abstraction has 1492 states and 1630 transitions. [2022-11-25 22:28:46,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:46,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1630 transitions. [2022-11-25 22:28:46,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 22:28:46,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:46,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:46,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-11-25 22:28:46,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:46,897 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:46,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:46,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2065621890, now seen corresponding path program 1 times [2022-11-25 22:28:46,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:46,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13051792] [2022-11-25 22:28:46,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:46,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:46,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:46,900 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:46,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-25 22:28:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:47,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:28:47,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:47,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:28:47,290 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:47,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13051792] [2022-11-25 22:28:47,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13051792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:47,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:47,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:28:47,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271651759] [2022-11-25 22:28:47,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:47,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:28:47,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:47,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:28:47,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:28:47,293 INFO L87 Difference]: Start difference. First operand 1492 states and 1630 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:28:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:47,367 INFO L93 Difference]: Finished difference Result 1495 states and 1635 transitions. [2022-11-25 22:28:47,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:28:47,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-11-25 22:28:47,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:47,373 INFO L225 Difference]: With dead ends: 1495 [2022-11-25 22:28:47,373 INFO L226 Difference]: Without dead ends: 1495 [2022-11-25 22:28:47,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:28:47,374 INFO L413 NwaCegarLoop]: 1444 mSDtfsCounter, 2 mSDsluCounter, 2880 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4324 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 [2022-11-25 22:28:47,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4324 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:28:47,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2022-11-25 22:28:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1495. [2022-11-25 22:28:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 895 states have (on average 1.8) internal successors, (1611), 1486 states have internal predecessors, (1611), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 22:28:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1635 transitions. [2022-11-25 22:28:47,402 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1635 transitions. Word has length 66 [2022-11-25 22:28:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:47,402 INFO L495 AbstractCegarLoop]: Abstraction has 1495 states and 1635 transitions. [2022-11-25 22:28:47,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:28:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1635 transitions. [2022-11-25 22:28:47,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 22:28:47,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:47,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:47,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:47,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:47,623 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:47,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:47,624 INFO L85 PathProgramCache]: Analyzing trace with hash 611814351, now seen corresponding path program 1 times [2022-11-25 22:28:47,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:47,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129917622] [2022-11-25 22:28:47,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:47,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:47,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:47,625 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:47,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-25 22:28:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:47,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:28:47,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:48,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:28:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:48,115 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:48,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129917622] [2022-11-25 22:28:48,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129917622] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:28:48,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2041700825] [2022-11-25 22:28:48,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:48,116 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:28:48,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:28:48,119 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:28:48,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-25 22:28:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:48,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:28:48,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:48,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:28:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:48,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2041700825] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:28:48,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931237541] [2022-11-25 22:28:48,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:48,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:28:48,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:28:48,771 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:28:48,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 22:28:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:49,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:28:49,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:49,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:28:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:49,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931237541] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:28:49,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:28:49,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-25 22:28:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390767099] [2022-11-25 22:28:49,200 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:28:49,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:28:49,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:28:49,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:28:49,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:28:49,203 INFO L87 Difference]: Start difference. First operand 1495 states and 1635 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:28:49,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:49,473 INFO L93 Difference]: Finished difference Result 1507 states and 1653 transitions. [2022-11-25 22:28:49,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 22:28:49,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-11-25 22:28:49,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:49,478 INFO L225 Difference]: With dead ends: 1507 [2022-11-25 22:28:49,478 INFO L226 Difference]: Without dead ends: 1507 [2022-11-25 22:28:49,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-25 22:28:49,479 INFO L413 NwaCegarLoop]: 1444 mSDtfsCounter, 12 mSDsluCounter, 2882 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4326 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:49,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4326 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:28:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2022-11-25 22:28:49,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1505. [2022-11-25 22:28:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 904 states have (on average 1.7986725663716814) internal successors, (1626), 1495 states have internal predecessors, (1626), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 22:28:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1650 transitions. [2022-11-25 22:28:49,512 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1650 transitions. Word has length 67 [2022-11-25 22:28:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:49,513 INFO L495 AbstractCegarLoop]: Abstraction has 1505 states and 1650 transitions. [2022-11-25 22:28:49,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:28:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1650 transitions. [2022-11-25 22:28:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 22:28:49,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:49,514 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:49,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:49,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:49,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:50,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:28:50,129 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:28:50,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:50,130 INFO L85 PathProgramCache]: Analyzing trace with hash -290789186, now seen corresponding path program 2 times [2022-11-25 22:28:50,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:28:50,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951534849] [2022-11-25 22:28:50,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:28:50,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:28:50,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:28:50,132 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:28:50,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-25 22:28:50,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:28:50,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:28:50,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 22:28:50,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:50,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:28:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:50,959 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:28:50,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951534849] [2022-11-25 22:28:50,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951534849] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:28:50,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1480757795] [2022-11-25 22:28:50,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:28:50,960 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:28:50,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:28:50,963 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:28:50,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-25 22:28:52,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:28:52,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:28:52,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 22:28:52,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:52,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:28:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:52,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1480757795] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:28:52,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166123949] [2022-11-25 22:28:52,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:28:52,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:28:52,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:28:52,565 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:28:52,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-25 22:29:01,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:29:01,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:29:01,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 22:29:01,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:29:01,834 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:29:01,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:29:01,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:29:02,452 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:29:02,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:29:02,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 22:29:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 22:29:02,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:29:02,740 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-25 22:29:02,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 22:29:02,749 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2022-11-25 22:29:02,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166123949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:29:02,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-25 22:29:02,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-25 22:29:02,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965214957] [2022-11-25 22:29:02,753 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-25 22:29:02,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 22:29:02,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:29:02,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 22:29:02,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-11-25 22:29:02,755 INFO L87 Difference]: Start difference. First operand 1505 states and 1650 transitions. Second operand has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:29:20,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:29:20,797 INFO L93 Difference]: Finished difference Result 1796 states and 1937 transitions. [2022-11-25 22:29:20,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-25 22:29:20,797 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 70 [2022-11-25 22:29:20,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:29:20,803 INFO L225 Difference]: With dead ends: 1796 [2022-11-25 22:29:20,803 INFO L226 Difference]: Without dead ends: 1792 [2022-11-25 22:29:20,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=475, Invalid=2692, Unknown=29, NotChecked=110, Total=3306 [2022-11-25 22:29:20,805 INFO L413 NwaCegarLoop]: 850 mSDtfsCounter, 2748 mSDsluCounter, 8581 mSDsCounter, 0 mSdLazyCounter, 7791 mSolverCounterSat, 105 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2753 SdHoareTripleChecker+Valid, 9431 SdHoareTripleChecker+Invalid, 7903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 7791 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:29:20,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2753 Valid, 9431 Invalid, 7903 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [105 Valid, 7791 Invalid, 7 Unknown, 0 Unchecked, 16.2s Time] [2022-11-25 22:29:20,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2022-11-25 22:29:20,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1513. [2022-11-25 22:29:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 913 states have (on average 1.7929901423877328) internal successors, (1637), 1503 states have internal predecessors, (1637), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 22:29:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1661 transitions. [2022-11-25 22:29:20,832 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1661 transitions. Word has length 70 [2022-11-25 22:29:20,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:29:20,832 INFO L495 AbstractCegarLoop]: Abstraction has 1513 states and 1661 transitions. [2022-11-25 22:29:20,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:29:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1661 transitions. [2022-11-25 22:29:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-25 22:29:20,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:29:20,833 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:29:20,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-25 22:29:21,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-25 22:29:21,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-25 22:29:21,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:29:21,450 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:29:21,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:29:21,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1980129055, now seen corresponding path program 1 times [2022-11-25 22:29:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:29:21,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729392265] [2022-11-25 22:29:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:29:21,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:29:21,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:29:21,453 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:29:21,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-25 22:29:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:29:21,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:29:21,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:29:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:29:22,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:29:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:29:22,871 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:29:22,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729392265] [2022-11-25 22:29:22,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729392265] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:29:22,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1098900380] [2022-11-25 22:29:22,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:29:22,871 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:29:22,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:29:22,874 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:29:22,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-25 22:29:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:29:23,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:29:23,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:29:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:29:23,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:29:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:29:23,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1098900380] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:29:23,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410760159] [2022-11-25 22:29:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:29:23,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:29:23,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:29:23,974 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:29:23,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-25 22:29:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:29:24,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 22:29:24,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:29:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:29:24,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:29:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:29:25,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410760159] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:29:25,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:29:25,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-11-25 22:29:25,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845673354] [2022-11-25 22:29:25,592 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:29:25,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 22:29:25,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:29:25,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 22:29:25,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 22:29:25,594 INFO L87 Difference]: Start difference. First operand 1513 states and 1661 transitions. Second operand has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 22:29:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:29:30,266 INFO L93 Difference]: Finished difference Result 1555 states and 1727 transitions. [2022-11-25 22:29:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-25 22:29:30,267 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2022-11-25 22:29:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:29:30,271 INFO L225 Difference]: With dead ends: 1555 [2022-11-25 22:29:30,271 INFO L226 Difference]: Without dead ends: 1549 [2022-11-25 22:29:30,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2022-11-25 22:29:30,273 INFO L413 NwaCegarLoop]: 1450 mSDtfsCounter, 51 mSDsluCounter, 23069 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 24519 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:29:30,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 24519 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-25 22:29:30,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2022-11-25 22:29:30,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1531. [2022-11-25 22:29:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 931 states have (on average 1.7830290010741139) internal successors, (1660), 1521 states have internal predecessors, (1660), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 22:29:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1684 transitions. [2022-11-25 22:29:30,297 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1684 transitions. Word has length 76 [2022-11-25 22:29:30,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:29:30,298 INFO L495 AbstractCegarLoop]: Abstraction has 1531 states and 1684 transitions. [2022-11-25 22:29:30,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 22:29:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1684 transitions. [2022-11-25 22:29:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-25 22:29:30,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:29:30,299 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:29:30,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-25 22:29:30,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-25 22:29:30,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-25 22:29:30,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:29:30,914 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:29:30,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:29:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash -272337953, now seen corresponding path program 2 times [2022-11-25 22:29:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:29:30,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107599468] [2022-11-25 22:29:30,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:29:30,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:29:30,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:29:30,916 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:29:30,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-25 22:29:31,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:29:31,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:29:31,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 22:29:31,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:29:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:29:32,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:29:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:29:36,832 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:29:36,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107599468] [2022-11-25 22:29:36,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107599468] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:29:36,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1012910128] [2022-11-25 22:29:36,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:29:36,833 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:29:36,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:29:36,834 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:29:36,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-25 22:29:38,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:29:38,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:29:38,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 22:29:38,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:29:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:29:39,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:29:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:29:40,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1012910128] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:29:40,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660472581] [2022-11-25 22:29:40,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:29:40,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:29:40,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:29:40,363 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:29:40,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-25 22:29:52,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:29:52,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:29:52,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-25 22:29:52,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:29:52,442 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:29:52,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:29:52,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:29:52,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:29:52,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:29:53,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 22:29:53,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:29:53,214 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2424) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2423) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:29:53,403 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2428))) (exists ((v_ArrVal_2427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2427) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:29:53,771 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2434))) (exists ((v_ArrVal_2433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2433))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-25 22:29:53,786 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2435))) (exists ((v_ArrVal_2436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2436)))) is different from true [2022-11-25 22:29:53,799 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2437 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2437) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2438))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-25 22:29:53,814 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2440))) (exists ((v_ArrVal_2439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2439))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-25 22:29:53,830 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2441))) (exists ((v_ArrVal_2442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2442) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:29:54,170 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2448))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2447)))) is different from true [2022-11-25 22:29:54,184 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2450) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2449)))) is different from true [2022-11-25 22:29:54,203 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2451))) (exists ((v_ArrVal_2452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2452) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:29:54,217 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2454) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2453) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-25 22:29:54,239 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2455))) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456)))) is different from true [2022-11-25 22:29:54,254 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458)))) is different from true [2022-11-25 22:29:54,269 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:29:54,285 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:29:54,299 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464)))) is different from true [2022-11-25 22:29:54,313 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:29:54,358 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:29:54,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:29:54,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:29:54,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:29:54,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:29:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 238 not checked. [2022-11-25 22:29:54,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:29:55,789 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2513) |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_2514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-25 22:29:55,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660472581] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:29:55,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-25 22:29:55,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 26] total 75 [2022-11-25 22:29:55,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356827770] [2022-11-25 22:29:55,797 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-25 22:29:55,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-25 22:29:55,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:29:55,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-25 22:29:55,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=2843, Unknown=37, NotChecked=2394, Total=6006 [2022-11-25 22:29:55,802 INFO L87 Difference]: Start difference. First operand 1531 states and 1684 transitions. Second operand has 75 states, 74 states have (on average 2.5405405405405403) internal successors, (188), 75 states have internal predecessors, (188), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:30:08,218 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (bvult (bvadd (_ bv7 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse6 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv19 32)) |c_#Ultimate.C_memset_#amount|)) (.cse9 (bvult (bvadd (_ bv15 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse2 (bvult (bvadd (_ bv2 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse13 (bvult (bvadd (_ bv14 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse5 (bvult (bvadd (_ bv18 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse3 (bvult (bvadd (_ bv6 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse17 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv5 32)) |c_#Ultimate.C_memset_#amount|)) (.cse15 (bvult (bvadd (_ bv13 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse11 (bvult (bvadd (_ bv10 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse19 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv12 32)) |c_#Ultimate.C_memset_#amount|)) (.cse20 (bvult (bvadd (_ bv11 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse16 (bvult (bvadd (_ bv17 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse8 (bvult (bvadd (_ bv16 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse14 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv1 32)) |c_#Ultimate.C_memset_#amount|)) (.cse7 (bvult |c_#Ultimate.C_memset_#t~loopctr360| |c_#Ultimate.C_memset_#amount|)) (.cse18 (bvult (bvadd (_ bv4 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse1 (bvult (bvadd (_ bv3 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse12 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv9 32)) |c_#Ultimate.C_memset_#amount|)) (.cse10 (bvult (bvadd (_ bv8 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse0 (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))))) (and (or .cse0 (not (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv21 32)) |c_#Ultimate.C_memset_#amount|)) (bvult (bvadd (_ bv22 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2448))) (or .cse0 .cse1 (not .cse2)) (or (not .cse3) .cse0 .cse4) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2434))) (or (not .cse5) .cse0 .cse6) (or .cse0 .cse7) (exists ((v_ArrVal_2433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2433))) (or .cse0 .cse8 (not .cse9)) (or .cse0 .cse10 (not .cse4)) (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_ArrVal_2437 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2437) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2440))) (exists ((v_ArrVal_2439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2439))) (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (or (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv20 32)) |c_#Ultimate.C_memset_#amount|) (not .cse6) .cse0) (exists ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2454) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2453) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_ArrVal_2438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2438))) (or .cse0 .cse11 (not .cse12)) (or (not .cse13) .cse0 .cse9) (exists ((v_ArrVal_2426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2426))) (or (not .cse14) .cse0 .cse2) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (or (not .cse15) .cse0 .cse13) (exists ((v_ArrVal_2450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2450) |c_#memory_$Pointer$.base|)) (or .cse0 .cse5 (not .cse16)) (or .cse0 .cse3 (not .cse17)) (exists ((v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2455))) (or .cse0 (not .cse18) .cse17) (or (not .cse19) .cse0 .cse15) (exists ((v_ArrVal_2447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2447))) (exists ((v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2451))) (exists ((v_ArrVal_2441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2441))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459) |c_#memory_$Pointer$.offset|)) (or .cse0 .cse20 (not .cse11)) (exists ((v_ArrVal_2428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2428))) (exists ((v_ArrVal_2425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2425))) (exists ((v_ArrVal_2435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2435))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458))) (exists ((v_ArrVal_2442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2442) |c_#memory_$Pointer$.offset|)) (or .cse19 .cse0 (not .cse20)) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2449))) (or .cse16 .cse0 (not .cse8)) (or .cse0 .cse14 (not .cse7)) (or .cse18 (not .cse1) .cse0) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461) |c_#memory_$Pointer$.base|)) (or .cse12 (not .cse10) .cse0) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456))) (exists ((v_ArrVal_2452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2452) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2427) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2436))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464))))) is different from true [2022-11-25 22:30:10,006 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465) |c_#memory_$Pointer$.offset|)) (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:30:11,625 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465) |c_#memory_$Pointer$.offset|)) (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))) (exists ((v_ArrVal_2426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2426))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2425))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:31:55,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:31:55,104 INFO L93 Difference]: Finished difference Result 1947 states and 2182 transitions. [2022-11-25 22:31:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-11-25 22:31:55,111 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 2.5405405405405403) internal successors, (188), 75 states have internal predecessors, (188), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 88 [2022-11-25 22:31:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:31:55,116 INFO L225 Difference]: With dead ends: 1947 [2022-11-25 22:31:55,117 INFO L226 Difference]: Without dead ends: 1928 [2022-11-25 22:31:55,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 351 SyntacticMatches, 16 SemanticMatches, 183 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 7488 ImplicationChecksByTransitivity, 66.8s TimeCoverageRelationStatistics Valid=5735, Invalid=20861, Unknown=220, NotChecked=7224, Total=34040 [2022-11-25 22:31:55,125 INFO L413 NwaCegarLoop]: 872 mSDtfsCounter, 2892 mSDsluCounter, 23600 mSDsCounter, 0 mSdLazyCounter, 24170 mSolverCounterSat, 324 mSolverCounterUnsat, 572 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 24472 SdHoareTripleChecker+Invalid, 52732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 24170 IncrementalHoareTripleChecker+Invalid, 572 IncrementalHoareTripleChecker+Unknown, 27666 IncrementalHoareTripleChecker+Unchecked, 58.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:31:55,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2897 Valid, 24472 Invalid, 52732 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [324 Valid, 24170 Invalid, 572 Unknown, 27666 Unchecked, 58.2s Time] [2022-11-25 22:31:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2022-11-25 22:31:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1617. [2022-11-25 22:31:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1017 states have (on average 1.7295968534906587) internal successors, (1759), 1606 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) [2022-11-25 22:31:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 1783 transitions. [2022-11-25 22:31:55,158 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 1783 transitions. Word has length 88 [2022-11-25 22:31:55,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:31:55,159 INFO L495 AbstractCegarLoop]: Abstraction has 1617 states and 1783 transitions. [2022-11-25 22:31:55,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 2.5405405405405403) internal successors, (188), 75 states have internal predecessors, (188), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:31:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1783 transitions. [2022-11-25 22:31:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 22:31:55,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:31:55,161 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:31:55,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-25 22:31:55,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-25 22:31:55,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-25 22:31:55,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:31:55,774 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:31:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:31:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash 363295479, now seen corresponding path program 1 times [2022-11-25 22:31:55,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:31:55,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163493685] [2022-11-25 22:31:55,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:31:55,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:31:55,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:31:55,777 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:31:55,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-25 22:31:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:31:56,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-25 22:31:56,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:31:56,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:31:56,916 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:31:56,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:31:56,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:31:57,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 22:31:57,600 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2891)))) is different from true [2022-11-25 22:31:57,653 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2893) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:31:57,869 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2898 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2898)))) is different from true [2022-11-25 22:31:58,100 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2905)))) is different from true [2022-11-25 22:31:58,752 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:31:58,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:31:58,879 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:31:58,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:31:58,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 22:31:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-11-25 22:31:58,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:32:01,081 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2923) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-25 22:32:01,421 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2969))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2923)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:32:01,424 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:32:01,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163493685] [2022-11-25 22:32:01,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163493685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:32:01,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1841072426] [2022-11-25 22:32:01,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:32:01,425 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:32:01,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:32:01,427 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:32:01,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-25 22:32:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:32:05,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 22:32:05,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:32:05,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:32:05,555 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:32:05,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:32:05,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:32:05,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 22:32:05,989 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3340)))) is different from true [2022-11-25 22:32:06,243 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3346 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3346) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:32:06,335 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3349) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:32:06,355 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3350) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:32:06,411 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3352) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:32:06,466 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3354)))) is different from true [2022-11-25 22:32:06,488 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3355)))) is different from true [2022-11-25 22:32:06,585 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3358)))) is different from true [2022-11-25 22:32:07,083 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3370 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3370)))) is different from true [2022-11-25 22:32:07,422 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:32:07,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:32:07,498 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:32:07,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:32:07,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 22:32:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 595 trivial. 360 not checked. [2022-11-25 22:32:07,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:32:09,956 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3424))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2923)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 22:32:09,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1841072426] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:32:09,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722749278] [2022-11-25 22:32:09,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:32:09,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:32:09,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:32:09,963 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:32:09,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-25 22:32:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:32:10,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-25 22:32:10,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:32:10,812 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:32:10,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:32:10,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:32:13,360 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:32:13,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:32:13,540 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:32:13,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:32:13,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 22:32:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-25 22:32:13,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:32:13,587 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3831) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:32:13,599 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3831) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:32:13,968 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-11-25 22:32:13,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-11-25 22:32:13,978 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3877))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3831)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2022-11-25 22:32:13,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722749278] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:32:13,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:32:13,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 12] total 32 [2022-11-25 22:32:13,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048099296] [2022-11-25 22:32:13,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:32:13,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 22:32:13,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:32:13,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 22:32:13,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=392, Unknown=38, NotChecked=1102, Total=1640 [2022-11-25 22:32:13,983 INFO L87 Difference]: Start difference. First operand 1617 states and 1783 transitions. Second operand has 33 states, 30 states have (on average 4.533333333333333) internal successors, (136), 32 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:32:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:32:43,160 INFO L93 Difference]: Finished difference Result 1889 states and 2041 transitions. [2022-11-25 22:32:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 22:32:43,161 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 4.533333333333333) internal successors, (136), 32 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2022-11-25 22:32:43,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:32:43,175 INFO L225 Difference]: With dead ends: 1889 [2022-11-25 22:32:43,175 INFO L226 Difference]: Without dead ends: 1889 [2022-11-25 22:32:43,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 197 SyntacticMatches, 122 SemanticMatches, 49 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=195, Invalid=824, Unknown=49, NotChecked=1482, Total=2550 [2022-11-25 22:32:43,177 INFO L413 NwaCegarLoop]: 849 mSDtfsCounter, 2686 mSDsluCounter, 8865 mSDsCounter, 0 mSdLazyCounter, 8834 mSolverCounterSat, 54 mSolverCounterUnsat, 1202 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2691 SdHoareTripleChecker+Valid, 9714 SdHoareTripleChecker+Invalid, 29057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 8834 IncrementalHoareTripleChecker+Invalid, 1202 IncrementalHoareTripleChecker+Unknown, 18967 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:32:43,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2691 Valid, 9714 Invalid, 29057 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 8834 Invalid, 1202 Unknown, 18967 Unchecked, 28.3s Time] [2022-11-25 22:32:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2022-11-25 22:32:43,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1616. [2022-11-25 22:32:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1017 states have (on average 1.7286135693215339) internal successors, (1758), 1605 states have internal predecessors, (1758), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 22:32:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 1782 transitions. [2022-11-25 22:32:43,215 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 1782 transitions. Word has length 113 [2022-11-25 22:32:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:32:43,216 INFO L495 AbstractCegarLoop]: Abstraction has 1616 states and 1782 transitions. [2022-11-25 22:32:43,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 4.533333333333333) internal successors, (136), 32 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:32:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1782 transitions. [2022-11-25 22:32:43,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 22:32:43,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:32:43,220 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:32:43,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-25 22:32:43,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-25 22:32:43,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-25 22:32:43,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:32:43,835 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:32:43,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:32:43,836 INFO L85 PathProgramCache]: Analyzing trace with hash 363295480, now seen corresponding path program 1 times [2022-11-25 22:32:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:32:43,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897582571] [2022-11-25 22:32:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:32:43,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:32:43,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:32:43,837 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:32:43,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-25 22:32:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:32:44,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-25 22:32:44,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:32:44,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:32:44,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:32:45,015 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:32:45,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:32:45,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:32:45,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:32:45,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 22:32:45,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:32:45,267 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4245)))) is different from true [2022-11-25 22:32:45,326 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4248))) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-11-25 22:32:45,457 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4257))) (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256)))) is different from true [2022-11-25 22:32:45,672 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4271))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4270) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:32:45,684 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4272))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4273) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:32:45,700 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4274) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4275)))) is different from true [2022-11-25 22:32:45,752 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4279) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4278 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4278) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-11-25 22:32:45,769 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4280))) (exists ((v_ArrVal_4281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4281)))) is different from true [2022-11-25 22:32:45,859 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4286))) (exists ((v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4287) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:32:45,873 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4288))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:32:45,888 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4291) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4290) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:32:45,902 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4293) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4292)))) is different from true [2022-11-25 22:32:45,983 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298))) (exists ((v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4299)))) is different from true [2022-11-25 22:32:46,029 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4303) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4302) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:32:46,042 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4305 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4305))) (exists ((v_ArrVal_4304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4304)))) is different from true [2022-11-25 22:32:46,158 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4312))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4313)))) is different from true [2022-11-25 22:32:46,173 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4315) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4314)))) is different from true [2022-11-25 22:32:46,225 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4318))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4319)))) is different from true [2022-11-25 22:32:46,327 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4325))) (exists ((v_ArrVal_4324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4324)))) is different from true [2022-11-25 22:32:46,378 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4329) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4328)))) is different from true [2022-11-25 22:32:46,466 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:32:46,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:32:46,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:32:46,604 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:32:46,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:32:46,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:32:46,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:32:46,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:32:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 690 not checked. [2022-11-25 22:32:46,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:32:46,889 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4332 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-25 22:32:46,933 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4332 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-25 22:32:47,999 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4332 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4424))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4425) .cse0 v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4425) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-25 22:32:48,011 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:32:48,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897582571] [2022-11-25 22:32:48,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897582571] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:32:48,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [528695945] [2022-11-25 22:32:48,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:32:48,012 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:32:48,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:32:48,012 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:32:48,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-25 22:32:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:32:52,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 22:32:52,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:32:52,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:32:52,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:32:53,338 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:32:53,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:32:53,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:32:53,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:32:53,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:32:53,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-25 22:32:53,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:32:54,136 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4799)))) is different from true [2022-11-25 22:32:54,309 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_ArrVal_4802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4802))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32)))) is different from true [2022-11-25 22:32:55,141 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4814)))) is different from true [2022-11-25 22:32:55,369 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4818)))) is different from true [2022-11-25 22:32:55,453 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4820 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4820)))) is different from true [2022-11-25 22:32:55,686 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4824)))) is different from true [2022-11-25 22:32:56,069 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4830)))) is different from true [2022-11-25 22:32:56,510 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4837)))) is different from true [2022-11-25 22:32:56,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:32:56,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:32:56,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:32:56,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2022-11-25 22:32:56,847 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-25 22:32:56,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2022-11-25 22:32:57,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-25 22:32:57,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-25 22:32:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 324 not checked. [2022-11-25 22:32:57,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:32:57,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 159 [2022-11-25 22:33:00,762 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4839 (_ BitVec 32)) (v_arrayElimCell_60 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4887))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse1 (select |c_#length| v_arrayElimCell_60))) (or (not (bvule (bvadd .cse0 (_ bv20 32)) .cse1)) (bvule (bvadd (_ bv8 32) (select (select (store .cse2 v_arrayElimCell_60 (store (select .cse2 v_arrayElimCell_60) (bvadd (_ bv16 32) .cse0) v_ArrVal_4839)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) .cse1))))) (forall ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_60 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4887))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_prenex_5 (_ BitVec 32))) (let ((.cse4 (select (select (store .cse5 v_arrayElimCell_60 (store (select .cse5 v_arrayElimCell_60) (bvadd (_ bv16 32) .cse6) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse4) (bvadd (_ bv8 32) .cse4)))) (not (bvule (bvadd .cse6 (_ bv20 32)) (select |c_#length| v_arrayElimCell_60))))))))) is different from false [2022-11-25 22:33:00,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [528695945] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:00,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137178915] [2022-11-25 22:33:00,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:00,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:00,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:00,796 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:33:00,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-25 22:33:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:01,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-25 22:33:01,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:01,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:33:01,770 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:33:01,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:33:01,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:33:01,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:33:01,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 22:33:01,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:33:01,947 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254)))) is different from true [2022-11-25 22:33:01,999 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5258) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:33:02,013 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259))) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-11-25 22:33:02,100 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:33:02,114 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268)))) is different from true [2022-11-25 22:33:02,180 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_5272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5272)))) is different from true [2022-11-25 22:33:02,354 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282)))) is different from true [2022-11-25 22:33:02,460 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5288))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5287) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:33:02,519 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291))) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292)))) is different from true [2022-11-25 22:33:02,534 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293)))) is different from true [2022-11-25 22:33:02,589 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297)))) is different from true [2022-11-25 22:33:02,604 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5300) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299)))) is different from true [2022-11-25 22:33:02,618 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5301))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302)))) is different from true [2022-11-25 22:33:02,632 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303))) (exists ((v_ArrVal_5304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5304) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:33:02,741 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310)))) is different from true [2022-11-25 22:33:02,757 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-11-25 22:33:02,773 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313))) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314)))) is different from true [2022-11-25 22:33:02,833 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:33:02,850 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320)))) is different from true [2022-11-25 22:33:02,903 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324))) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:33:02,957 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (exists ((v_ArrVal_5327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5327)))) is different from true [2022-11-25 22:33:02,972 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:33:02,987 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5332))) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:33:03,002 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5334) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5333)))) is different from true [2022-11-25 22:33:03,056 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5337))) (exists ((v_ArrVal_5338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5338)))) is different from true [2022-11-25 22:33:03,083 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5340))) (exists ((v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5339))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-11-25 22:33:03,148 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:33:03,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:33:03,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:33:03,259 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:33:03,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:33:03,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:33:03,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:33:03,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:33:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 819 not checked. [2022-11-25 22:33:03,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:03,409 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5342) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-25 22:33:03,457 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5342) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-25 22:33:04,533 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5434) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5433) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5433))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5434) .cse2 v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5342) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-25 22:33:04,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137178915] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:04,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:33:04,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 19, 36] total 74 [2022-11-25 22:33:04,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669310813] [2022-11-25 22:33:04,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:33:04,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-25 22:33:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:33:04,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-25 22:33:04,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=562, Unknown=89, NotChecked=6466, Total=7310 [2022-11-25 22:33:04,550 INFO L87 Difference]: Start difference. First operand 1616 states and 1782 transitions. Second operand has 75 states, 72 states have (on average 3.4305555555555554) internal successors, (247), 75 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:33:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:50,553 INFO L93 Difference]: Finished difference Result 2437 states and 2632 transitions. [2022-11-25 22:33:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 22:33:50,554 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 72 states have (on average 3.4305555555555554) internal successors, (247), 75 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 113 [2022-11-25 22:33:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:50,558 INFO L225 Difference]: With dead ends: 2437 [2022-11-25 22:33:50,559 INFO L226 Difference]: Without dead ends: 2437 [2022-11-25 22:33:50,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 194 SyntacticMatches, 81 SemanticMatches, 94 ConstructedPredicates, 61 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=300, Invalid=1018, Unknown=116, NotChecked=7686, Total=9120 [2022-11-25 22:33:50,561 INFO L413 NwaCegarLoop]: 655 mSDtfsCounter, 4625 mSDsluCounter, 7281 mSDsCounter, 0 mSdLazyCounter, 13466 mSolverCounterSat, 82 mSolverCounterUnsat, 1235 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4630 SdHoareTripleChecker+Valid, 7936 SdHoareTripleChecker+Invalid, 146130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 13466 IncrementalHoareTripleChecker+Invalid, 1235 IncrementalHoareTripleChecker+Unknown, 131347 IncrementalHoareTripleChecker+Unchecked, 44.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:50,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4630 Valid, 7936 Invalid, 146130 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [82 Valid, 13466 Invalid, 1235 Unknown, 131347 Unchecked, 44.2s Time] [2022-11-25 22:33:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2022-11-25 22:33:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1615. [2022-11-25 22:33:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1017 states have (on average 1.727630285152409) internal successors, (1757), 1604 states have internal predecessors, (1757), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 22:33:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 1781 transitions. [2022-11-25 22:33:50,595 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 1781 transitions. Word has length 113 [2022-11-25 22:33:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:50,596 INFO L495 AbstractCegarLoop]: Abstraction has 1615 states and 1781 transitions. [2022-11-25 22:33:50,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 72 states have (on average 3.4305555555555554) internal successors, (247), 75 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:33:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1781 transitions. [2022-11-25 22:33:50,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-25 22:33:50,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:50,598 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:50,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-25 22:33:50,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-25 22:33:51,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-25 22:33:51,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:33:51,217 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:33:51,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:51,217 INFO L85 PathProgramCache]: Analyzing trace with hash -381691963, now seen corresponding path program 1 times [2022-11-25 22:33:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:33:51,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335912145] [2022-11-25 22:33:51,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:51,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:33:51,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:33:51,219 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:33:51,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-25 22:33:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:52,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-25 22:33:52,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:52,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:33:52,543 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:33:52,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:33:52,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:33:52,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 22:33:53,608 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5832) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:33:53,742 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5836) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:33:53,851 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839)))) is different from true [2022-11-25 22:33:54,276 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850)))) is different from true [2022-11-25 22:33:54,629 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:33:54,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:33:54,759 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:33:54,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:33:54,877 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:33:54,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:33:54,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 22:33:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-11-25 22:33:54,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:57,117 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5859) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-25 22:33:57,137 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5858))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5859)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-25 22:33:57,160 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5858))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5859)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:33:57,515 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5905 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5905))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5858)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5859)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-25 22:33:57,519 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:33:57,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335912145] [2022-11-25 22:33:57,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335912145] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:57,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [822058833] [2022-11-25 22:33:57,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:57,520 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:33:57,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:33:57,521 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:33:57,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-25 22:34:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:34:25,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-25 22:34:25,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:34:25,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:34:25,522 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:34:25,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:34:25,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:34:25,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 22:34:25,852 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_6289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6289) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:34:27,311 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_6328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6328) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:34:27,368 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:34:27,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:34:27,467 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:34:27,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:34:27,524 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:34:27,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:34:27,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 22:34:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-11-25 22:34:27,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:34:27,584 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6330) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-25 22:34:27,597 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-11-25 22:34:27,619 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6329))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 22:34:27,634 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6329))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 22:34:27,970 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6376))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6329)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 22:34:27,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [822058833] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:34:27,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720920237] [2022-11-25 22:34:27,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:34:27,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:34:27,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:34:27,976 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:34:27,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-25 22:34:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:34:28,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-25 22:34:28,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:34:28,954 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:34:28,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:34:28,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:34:29,170 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6754))) is different from true [2022-11-25 22:34:29,177 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6755 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6755))) is different from true [2022-11-25 22:34:29,185 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6756) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,192 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6757) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,198 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6758))) is different from true [2022-11-25 22:34:29,205 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6759))) is different from true [2022-11-25 22:34:29,211 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6760) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,217 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6761))) is different from true [2022-11-25 22:34:29,223 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6762 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6762))) is different from true [2022-11-25 22:34:29,229 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6763) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,235 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6764))) is different from true [2022-11-25 22:34:29,241 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6765) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,247 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6766))) is different from true [2022-11-25 22:34:29,252 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6767) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,258 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6768))) is different from true [2022-11-25 22:34:29,264 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6769))) is different from true [2022-11-25 22:34:29,273 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6770) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,279 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6771))) is different from true [2022-11-25 22:34:29,286 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6772))) is different from true [2022-11-25 22:34:29,293 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6773))) is different from true [2022-11-25 22:34:29,299 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6774))) is different from true [2022-11-25 22:34:29,305 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6775) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,311 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6776) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,317 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6777))) is different from true [2022-11-25 22:34:29,323 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6778))) is different from true [2022-11-25 22:34:29,329 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6779 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6779) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,336 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6780 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6780) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,342 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6781))) is different from true [2022-11-25 22:34:29,348 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6782))) is different from true [2022-11-25 22:34:29,355 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6783))) is different from true [2022-11-25 22:34:29,361 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6784))) is different from true [2022-11-25 22:34:29,367 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6785 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6785))) is different from true [2022-11-25 22:34:29,373 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) is different from true [2022-11-25 22:34:29,379 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,389 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6788) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,396 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6789))) is different from true [2022-11-25 22:34:29,401 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790))) is different from true [2022-11-25 22:34:29,407 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,413 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792))) is different from true [2022-11-25 22:34:29,419 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793))) is different from true [2022-11-25 22:34:29,425 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6794) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,431 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6795))) is different from true [2022-11-25 22:34:29,437 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6796))) is different from true [2022-11-25 22:34:29,443 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6797) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:34:29,471 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:34:29,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-25 22:34:29,563 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:34:29,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-25 22:34:29,660 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:34:29,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:34:29,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 22:34:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-25 22:34:29,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:34:29,783 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-25 22:34:29,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 22:34:29,791 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6799) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2022-11-25 22:34:29,802 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-25 22:34:29,821 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6798)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-11-25 22:34:29,834 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6798))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-25 22:34:30,177 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6845))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6798)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2022-11-25 22:34:30,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720920237] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:34:30,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:34:30,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 55] total 69 [2022-11-25 22:34:30,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114697720] [2022-11-25 22:34:30,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:34:30,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-25 22:34:30,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:34:30,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-25 22:34:30,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=431, Unknown=86, NotChecked=6592, Total=7310 [2022-11-25 22:34:30,185 INFO L87 Difference]: Start difference. First operand 1615 states and 1781 transitions. Second operand has 70 states, 67 states have (on average 2.582089552238806) internal successors, (173), 70 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:34:31,662 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6755 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6755))) (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_6289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5832) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6328) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850)))) is different from true [2022-11-25 22:34:31,667 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6756) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_6289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5832) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6328) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850)))) is different from true [2022-11-25 22:34:31,682 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814))) (exists ((v_ArrVal_6328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6328) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:34:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:34:59,005 INFO L93 Difference]: Finished difference Result 3230 states and 3526 transitions. [2022-11-25 22:34:59,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-25 22:34:59,006 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 67 states have (on average 2.582089552238806) internal successors, (173), 70 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 116 [2022-11-25 22:34:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:34:59,012 INFO L225 Difference]: With dead ends: 3230 [2022-11-25 22:34:59,012 INFO L226 Difference]: Without dead ends: 3230 [2022-11-25 22:34:59,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 207 SyntacticMatches, 86 SemanticMatches, 94 ConstructedPredicates, 67 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=267, Invalid=717, Unknown=96, NotChecked=8040, Total=9120 [2022-11-25 22:34:59,014 INFO L413 NwaCegarLoop]: 1268 mSDtfsCounter, 2982 mSDsluCounter, 7810 mSDsCounter, 0 mSdLazyCounter, 7676 mSolverCounterSat, 54 mSolverCounterUnsat, 1803 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2998 SdHoareTripleChecker+Valid, 9078 SdHoareTripleChecker+Invalid, 117082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 7676 IncrementalHoareTripleChecker+Invalid, 1803 IncrementalHoareTripleChecker+Unknown, 107549 IncrementalHoareTripleChecker+Unchecked, 27.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:34:59,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2998 Valid, 9078 Invalid, 117082 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 7676 Invalid, 1803 Unknown, 107549 Unchecked, 27.8s Time] [2022-11-25 22:34:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2022-11-25 22:34:59,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 1614. [2022-11-25 22:34:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1017 states have (on average 1.7266470009832842) internal successors, (1756), 1603 states have internal predecessors, (1756), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 22:34:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 1780 transitions. [2022-11-25 22:34:59,045 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 1780 transitions. Word has length 116 [2022-11-25 22:34:59,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:34:59,045 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 1780 transitions. [2022-11-25 22:34:59,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 67 states have (on average 2.582089552238806) internal successors, (173), 70 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:34:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1780 transitions. [2022-11-25 22:34:59,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-25 22:34:59,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:34:59,047 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:34:59,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-25 22:34:59,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-11-25 22:34:59,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-11-25 22:34:59,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:34:59,664 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:34:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:34:59,665 INFO L85 PathProgramCache]: Analyzing trace with hash -381691962, now seen corresponding path program 1 times [2022-11-25 22:34:59,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:34:59,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617477013] [2022-11-25 22:34:59,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:34:59,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:34:59,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:34:59,666 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:34:59,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-25 22:35:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:00,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-25 22:35:00,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:35:00,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:35:01,336 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:35:01,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:35:01,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:35:01,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:35:01,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:35:01,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-25 22:35:01,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:35:01,696 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7229))) (exists ((v_ArrVal_7230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7230) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:35:01,708 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7232))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7231)))) is different from true [2022-11-25 22:35:01,722 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7234))) (exists ((v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7233) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-11-25 22:35:01,807 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7240) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7239)))) is different from true [2022-11-25 22:35:01,820 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7242 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7242))) (exists ((v_ArrVal_7241 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7241)))) is different from true [2022-11-25 22:35:01,833 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7244))) (exists ((v_ArrVal_7243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7243) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:35:01,846 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7246))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7245)))) is different from true [2022-11-25 22:35:01,859 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7248))) (exists ((v_ArrVal_7247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7247) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:35:01,872 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7250) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7249)))) is different from true [2022-11-25 22:35:01,886 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7252) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7251)))) is different from true [2022-11-25 22:35:01,900 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7254))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7253)))) is different from true [2022-11-25 22:35:01,914 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7256))) (exists ((v_ArrVal_7255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7255) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:35:01,928 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7258) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7257)))) is different from true [2022-11-25 22:35:01,942 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7259) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7260)))) is different from true [2022-11-25 22:35:01,957 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7261) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7262) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:35:01,970 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7264))) (exists ((v_ArrVal_7263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7263)))) is different from true [2022-11-25 22:35:01,984 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7265))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7266)))) is different from true [2022-11-25 22:35:01,997 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7267) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7268) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:35:02,010 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7270))) (exists ((v_ArrVal_7269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7269)))) is different from true [2022-11-25 22:35:02,023 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7271))) (exists ((v_ArrVal_7272 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7272) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:35:02,036 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7273))) (exists ((v_ArrVal_7274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7274) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:35:02,061 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7275))) (exists ((v_ArrVal_7276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7276) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:35:02,074 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7278))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7277) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:35:02,088 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7279))) (exists ((v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7280)))) is different from true [2022-11-25 22:35:02,123 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7282))) (exists ((v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7281)))) is different from true [2022-11-25 22:35:02,139 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7283) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7284) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:35:02,155 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7285))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7286)))) is different from true [2022-11-25 22:35:02,170 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7287 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7287))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7288 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7288) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:35:02,185 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7289) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7290) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:35:02,210 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7291))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7292)))) is different from true [2022-11-25 22:35:02,223 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7293) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7294) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:35:02,236 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7295))) (exists ((v_ArrVal_7296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7296)))) is different from true [2022-11-25 22:35:02,249 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7298) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7297)))) is different from true [2022-11-25 22:35:02,263 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7299) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7300) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:35:02,276 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7302) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7301 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7301) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-11-25 22:35:02,289 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7303) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7304) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:35:02,302 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7305) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7306)))) is different from true [2022-11-25 22:35:02,315 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7308) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7307)))) is different from true [2022-11-25 22:35:02,328 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7310))) (exists ((v_ArrVal_7309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7309) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:35:02,341 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7312) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7311)))) is different from true [2022-11-25 22:35:02,353 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7314))) (exists ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7313)))) is different from true [2022-11-25 22:35:02,418 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:35:02,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:35:02,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:35:02,563 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:35:02,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:35:02,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:35:02,702 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:35:02,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:35:02,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:35:02,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-25 22:35:02,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:35:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2022-11-25 22:35:02,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:35:03,007 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-25 22:35:03,045 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-25 22:35:03,120 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7315) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7316))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7315) .cse2 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-25 22:35:03,182 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7315) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7316))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7315) .cse3 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-25 22:35:05,151 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7410))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7316))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7409) .cse0 v_ArrVal_7315) .cse1 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7410))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7409) .cse6 v_ArrVal_7315) (select (select (store .cse7 .cse6 v_ArrVal_7316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7317))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-25 22:35:05,168 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:35:05,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617477013] [2022-11-25 22:35:05,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617477013] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:35:05,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1429071638] [2022-11-25 22:35:05,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:05,168 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:35:05,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:35:05,169 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:35:05,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-25 22:37:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:35,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-25 22:37:35,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:35,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:37:35,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:37:35,396 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:37:35,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:37:35,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:37:35,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:37:35,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 22:37:35,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:37:35,893 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7794) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7795) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:35,916 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:35,937 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798)))) is different from true [2022-11-25 22:37:35,956 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7801) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:35,975 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7803))) (exists ((v_ArrVal_7802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7802)))) is different from true [2022-11-25 22:37:35,994 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7805) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7804)))) is different from true [2022-11-25 22:37:36,013 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7807))) (exists ((v_ArrVal_7806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7806)))) is different from true [2022-11-25 22:37:36,033 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7808)))) is different from true [2022-11-25 22:37:36,065 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7811)))) is different from true [2022-11-25 22:37:36,084 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7813))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7812)))) is different from true [2022-11-25 22:37:36,103 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7815))) (exists ((v_ArrVal_7814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7814)))) is different from true [2022-11-25 22:37:36,123 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7816) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7817) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:36,143 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7818) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7819)))) is different from true [2022-11-25 22:37:36,162 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7821) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7820)))) is different from true [2022-11-25 22:37:36,181 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7822))) (exists ((v_ArrVal_7823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7823)))) is different from true [2022-11-25 22:37:36,200 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7824))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7825) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:36,219 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7826) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7827) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:36,238 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7829))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7828 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7828)))) is different from true [2022-11-25 22:37:36,257 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7831))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7830) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:36,277 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7832))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7833)))) is different from true [2022-11-25 22:37:36,296 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7834 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7834) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7835 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7835)))) is different from true [2022-11-25 22:37:36,315 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7837)))) is different from true [2022-11-25 22:37:36,334 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7838))) (exists ((v_ArrVal_7839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7839)))) is different from true [2022-11-25 22:37:36,353 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7841))) (exists ((v_ArrVal_7840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7840)))) is different from true [2022-11-25 22:37:36,372 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7842 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7842))) (exists ((v_ArrVal_7843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7843) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:36,392 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7844) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7845)))) is different from true [2022-11-25 22:37:36,411 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7847))) (exists ((v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7846) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-11-25 22:37:36,431 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7848 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7848) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7849)))) is different from true [2022-11-25 22:37:36,451 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7850))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7851)))) is different from true [2022-11-25 22:37:36,469 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7852 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7852) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7853) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:36,489 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7854) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7855)))) is different from true [2022-11-25 22:37:36,508 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7857))) (exists ((v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7856)))) is different from true [2022-11-25 22:37:36,528 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7858))) (exists ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7859) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:36,547 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7861))) (exists ((v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7860)))) is different from true [2022-11-25 22:37:36,565 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7863) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7862) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:36,585 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7864) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7865)))) is different from true [2022-11-25 22:37:36,604 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7867))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7866) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:36,623 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7869))) (exists ((v_ArrVal_7868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7868)))) is different from true [2022-11-25 22:37:36,643 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7871))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7870) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:36,662 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7873) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7872)))) is different from true [2022-11-25 22:37:36,681 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7875) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7874)))) is different from true [2022-11-25 22:37:36,700 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7877))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7876 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7876) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:36,719 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7879) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:36,789 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:37:36,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:37:36,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:37:37,044 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:37:37,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:37:37,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:37:37,237 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:37:37,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:37:37,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:37:37,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:37:37,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:37:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-11-25 22:37:37,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:37:37,402 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-11-25 22:37:37,443 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-25 22:37:37,507 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7881) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7880))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7881) .cse2 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-25 22:37:37,560 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7880))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7881) .cse1 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7881) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2022-11-25 22:37:39,176 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7975))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7974) .cse1 v_ArrVal_7881) (select (select (store .cse2 .cse1 v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7883))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7975))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7880))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7974) .cse4 v_ArrVal_7881) .cse5 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-25 22:37:39,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1429071638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:37:39,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170269135] [2022-11-25 22:37:39,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:39,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:37:39,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:37:39,194 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:37:39,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-25 22:37:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:40,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-25 22:37:40,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:40,342 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:37:40,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:37:40,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:37:40,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:37:40,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:37:40,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 22:37:40,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:37:40,574 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8356 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8356))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8357)))) is different from true [2022-11-25 22:37:40,594 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8359))) (exists ((v_ArrVal_8358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8358) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:40,663 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8363)))) is different from true [2022-11-25 22:37:40,683 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365)))) is different from true [2022-11-25 22:37:40,703 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8367))) (exists ((v_ArrVal_8366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8366)))) is different from true [2022-11-25 22:37:40,723 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_ArrVal_8369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8369) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:40,743 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8370 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8370))) (exists ((v_ArrVal_8371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8371)))) is different from true [2022-11-25 22:37:40,763 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8373))) (exists ((v_ArrVal_8372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8372) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:40,784 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374)))) is different from true [2022-11-25 22:37:40,804 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376))) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:40,842 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8379))) (exists ((v_ArrVal_8378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8378) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:40,862 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8380))) (exists ((v_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381)))) is different from true [2022-11-25 22:37:40,881 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383)))) is different from true [2022-11-25 22:37:40,901 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8385))) (exists ((v_ArrVal_8384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8384) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:40,921 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8386))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:40,941 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8388) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:40,961 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8390) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8391) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:40,981 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8393) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8392) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:41,001 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8395) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:41,021 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8396) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8397)))) is different from true [2022-11-25 22:37:41,040 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8398 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8398) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8399)))) is different from true [2022-11-25 22:37:41,060 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8400) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401)))) is different from true [2022-11-25 22:37:41,080 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8402))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8403) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:41,100 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8404))) (exists ((v_ArrVal_8405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8405) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:41,120 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8407))) (exists ((v_ArrVal_8406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8406)))) is different from true [2022-11-25 22:37:41,140 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8408) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8409)))) is different from true [2022-11-25 22:37:41,160 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8410))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8411)))) is different from true [2022-11-25 22:37:41,180 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8413))) (exists ((v_ArrVal_8412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8412))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-11-25 22:37:41,200 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8415) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8414)))) is different from true [2022-11-25 22:37:41,220 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8417))) (exists ((v_ArrVal_8416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8416)))) is different from true [2022-11-25 22:37:41,241 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8418))) (exists ((v_ArrVal_8419 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8419) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:37:41,280 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8421) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8420))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-11-25 22:37:41,301 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8423 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8423))) (exists ((v_ArrVal_8422 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8422)))) is different from true [2022-11-25 22:37:41,321 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8425 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8425) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8424)))) is different from true [2022-11-25 22:37:41,341 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8426))) (exists ((v_ArrVal_8427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8427)))) is different from true [2022-11-25 22:37:41,361 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8428))) (exists ((v_ArrVal_8429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8429)))) is different from true [2022-11-25 22:37:41,381 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8430))) (exists ((v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8431))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-11-25 22:37:41,407 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8433) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8432)))) is different from true [2022-11-25 22:37:41,432 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8434) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8435) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:41,457 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8436 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8436) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8437)))) is different from true [2022-11-25 22:37:41,482 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8438))) (exists ((v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8439)))) is different from true [2022-11-25 22:37:41,508 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8441))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8440) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:37:41,533 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8443 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8443) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8442)))) is different from true [2022-11-25 22:37:41,621 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:37:41,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:37:41,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:37:41,807 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:37:41,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:37:41,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:37:41,911 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:37:41,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:37:41,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:37:41,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:37:41,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:37:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-11-25 22:37:41,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:37:42,071 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-25 22:37:42,112 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-25 22:37:42,210 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8445) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8444) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8444))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8445) .cse2 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-25 22:37:42,273 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8445) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8444) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8444))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8445) .cse3 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-25 22:37:44,097 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8539))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8538) .cse1 v_ArrVal_8445) (select (select (store .cse2 .cse1 v_ArrVal_8444) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8447))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8539))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8444))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8538) .cse4 v_ArrVal_8445) .cse5 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-25 22:37:44,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170269135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:37:44,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:37:44,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 53, 54] total 144 [2022-11-25 22:37:44,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567920831] [2022-11-25 22:37:44,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:37:44,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 145 states [2022-11-25 22:37:44,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:44,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2022-11-25 22:37:44,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=448, Unknown=155, NotChecked=25134, Total=26082 [2022-11-25 22:37:44,122 INFO L87 Difference]: Start difference. First operand 1614 states and 1780 transitions. Second operand has 145 states, 142 states have (on average 2.063380281690141) internal successors, (293), 145 states have internal predecessors, (293), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:37:45,508 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8356 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8356))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7228))) (exists ((v_ArrVal_8357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8357))) (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227)))) is different from true [2022-11-25 22:37:45,516 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8359))) (exists ((v_ArrVal_7228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7228))) (exists ((v_ArrVal_7240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7240) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7239))) (exists ((v_ArrVal_8363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8363))) (exists ((v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7794) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8358) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7795) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7229))) (exists ((v_ArrVal_7230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227)))) is different from true [2022-11-25 22:37:45,526 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7232))) (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7231))) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7228))) (exists ((v_ArrVal_7240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7240) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7239))) (exists ((v_ArrVal_8363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8363))) (exists ((v_ArrVal_7242 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7242))) (exists ((v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7794) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7795) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7241 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7241))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_7229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7229))) (exists ((v_ArrVal_7230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227)))) is different from true [2022-11-25 22:37:45,536 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7234))) (exists ((v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7233) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7232))) (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7244))) (exists ((v_ArrVal_7231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7231))) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7228))) (exists ((v_ArrVal_7243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7243) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7240) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7239))) (exists ((v_ArrVal_8363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8363))) (exists ((v_ArrVal_7242 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7242))) (exists ((v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7794) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798))) (exists ((v_ArrVal_8367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8367))) (exists ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7795) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8366))) (exists ((v_ArrVal_7241 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7241))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_7229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7229))) (exists ((v_ArrVal_7230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227)))) is different from true [2022-11-25 22:38:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:38:15,532 INFO L93 Difference]: Finished difference Result 2435 states and 2630 transitions. [2022-11-25 22:38:15,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 22:38:15,535 INFO L78 Accepts]: Start accepts. Automaton has has 145 states, 142 states have (on average 2.063380281690141) internal successors, (293), 145 states have internal predecessors, (293), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 116 [2022-11-25 22:38:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:38:15,540 INFO L225 Difference]: With dead ends: 2435 [2022-11-25 22:38:15,541 INFO L226 Difference]: Without dead ends: 2435 [2022-11-25 22:38:15,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 206 SyntacticMatches, 11 SemanticMatches, 174 ConstructedPredicates, 146 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=458, Invalid=829, Unknown=167, NotChecked=29346, Total=30800 [2022-11-25 22:38:15,544 INFO L413 NwaCegarLoop]: 865 mSDtfsCounter, 3586 mSDsluCounter, 3867 mSDsCounter, 0 mSdLazyCounter, 5912 mSolverCounterSat, 60 mSolverCounterUnsat, 656 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3591 SdHoareTripleChecker+Valid, 4732 SdHoareTripleChecker+Invalid, 303756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 5912 IncrementalHoareTripleChecker+Invalid, 656 IncrementalHoareTripleChecker+Unknown, 297128 IncrementalHoareTripleChecker+Unchecked, 29.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:38:15,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3591 Valid, 4732 Invalid, 303756 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 5912 Invalid, 656 Unknown, 297128 Unchecked, 29.6s Time] [2022-11-25 22:38:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2022-11-25 22:38:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1613. [2022-11-25 22:38:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1017 states have (on average 1.7256637168141593) internal successors, (1755), 1602 states have internal predecessors, (1755), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 22:38:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 1779 transitions. [2022-11-25 22:38:15,568 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 1779 transitions. Word has length 116 [2022-11-25 22:38:15,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:38:15,568 INFO L495 AbstractCegarLoop]: Abstraction has 1613 states and 1779 transitions. [2022-11-25 22:38:15,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 145 states, 142 states have (on average 2.063380281690141) internal successors, (293), 145 states have internal predecessors, (293), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:38:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 1779 transitions. [2022-11-25 22:38:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-25 22:38:15,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:38:15,570 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:38:15,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-25 22:38:15,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-25 22:38:15,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-11-25 22:38:16,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:38:16,183 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:38:16,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:38:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2088416094, now seen corresponding path program 1 times [2022-11-25 22:38:16,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:38:16,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017775093] [2022-11-25 22:38:16,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:38:16,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:38:16,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:38:16,185 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:38:16,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-25 22:38:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:38:17,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-25 22:38:17,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:38:17,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:38:17,912 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:38:17,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:38:17,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:38:18,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 22:38:19,123 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8944)))) is different from true [2022-11-25 22:38:19,569 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8951) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:38:19,682 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8953)))) is different from true [2022-11-25 22:38:19,717 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8954)))) is different from true [2022-11-25 22:38:19,814 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:38:19,990 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8959) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:38:20,114 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8961)))) is different from true [2022-11-25 22:38:20,319 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:38:20,452 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8966)))) is different from true [2022-11-25 22:38:20,791 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8970) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:38:21,393 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:38:21,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:38:21,643 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:38:21,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:38:21,849 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:38:21,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:38:22,055 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:38:22,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:38:22,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 22:38:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 561 trivial. 395 not checked. [2022-11-25 22:38:22,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:38:22,365 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8980) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2022-11-25 22:38:22,388 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-25 22:38:22,422 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8979))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-25 22:38:22,449 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8979))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:38:22,489 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8978))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8979)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 22:38:22,519 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8978))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8979)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 22:38:23,051 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9026))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8978)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8979)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 22:38:23,058 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:38:23,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017775093] [2022-11-25 22:38:23,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017775093] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:38:23,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [285842704] [2022-11-25 22:38:23,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:38:23,059 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:38:23,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:38:23,060 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:38:23,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-25 22:39:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:39:30,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-25 22:39:30,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:39:30,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:39:30,640 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:39:30,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:39:30,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:39:30,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 22:39:30,951 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9421)))) is different from true [2022-11-25 22:39:31,296 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9426) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:39:31,597 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9431)))) is different from true [2022-11-25 22:39:31,632 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9432)))) is different from true [2022-11-25 22:39:31,978 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9437)))) is different from true [2022-11-25 22:39:32,747 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9448 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9448) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:39:34,025 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:39:34,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:39:34,166 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:39:34,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:39:34,292 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:39:34,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:39:34,412 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:39:34,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:39:34,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 22:39:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2022-11-25 22:39:34,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:39:36,661 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9467) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-25 22:39:36,696 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9466))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9467)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:39:36,724 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9467)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-25 22:39:36,765 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9465))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9467)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:39:38,718 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9513))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9467)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 22:39:38,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [285842704] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:39:38,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744512000] [2022-11-25 22:39:38,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:39:38,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:39:38,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:39:38,727 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:39:38,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-25 22:39:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:39:39,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 22:39:39,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:39:40,043 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:39:40,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:39:40,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:39:40,507 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9906 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9906) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,520 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9907) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,532 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9908 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9908) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,545 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9909 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9909) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,558 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9910))) is different from true [2022-11-25 22:39:40,570 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9911))) is different from true [2022-11-25 22:39:40,583 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9912) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,597 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9913 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9913) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,611 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9914) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,623 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9915) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,639 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9916))) is different from true [2022-11-25 22:39:40,652 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9917))) is different from true [2022-11-25 22:39:40,665 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9918))) is different from true [2022-11-25 22:39:40,677 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9919))) is different from true [2022-11-25 22:39:40,690 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9920))) is different from true [2022-11-25 22:39:40,703 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9921))) is different from true [2022-11-25 22:39:40,716 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9922))) is different from true [2022-11-25 22:39:40,728 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9923))) is different from true [2022-11-25 22:39:40,741 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9924 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9924) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,754 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9925))) is different from true [2022-11-25 22:39:40,767 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9926))) is different from true [2022-11-25 22:39:40,780 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9927))) is different from true [2022-11-25 22:39:40,793 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9928))) is different from true [2022-11-25 22:39:40,805 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9929))) is different from true [2022-11-25 22:39:40,818 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9930))) is different from true [2022-11-25 22:39:40,831 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9931))) is different from true [2022-11-25 22:39:40,845 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9932) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,859 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9933))) is different from true [2022-11-25 22:39:40,873 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9934) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,886 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9935))) is different from true [2022-11-25 22:39:40,899 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9936))) is different from true [2022-11-25 22:39:40,913 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9937) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,926 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9938) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,939 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9939) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,952 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9940))) is different from true [2022-11-25 22:39:40,985 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9941) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:40,998 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9942))) is different from true [2022-11-25 22:39:41,010 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9943))) is different from true [2022-11-25 22:39:41,023 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9944))) is different from true [2022-11-25 22:39:41,035 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9945))) is different from true [2022-11-25 22:39:41,048 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9946) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:39:41,060 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9947))) is different from true [2022-11-25 22:39:41,076 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9948))) is different from true [2022-11-25 22:39:41,092 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9949))) is different from true [2022-11-25 22:39:41,159 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:39:41,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-25 22:39:41,346 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:39:41,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-25 22:39:41,533 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:39:41,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:39:41,909 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:39:41,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:39:41,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 22:39:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-25 22:39:41,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:39:41,995 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9952) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:39:42,018 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9952) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-11-25 22:39:42,066 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-11-25 22:39:42,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-11-25 22:39:42,083 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem36#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9951))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2022-11-25 22:39:42,103 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9951))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9952)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-11-25 22:39:42,137 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9950)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_9951))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) is different from false [2022-11-25 22:39:42,162 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9950))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_9951))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2022-11-25 22:39:42,703 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9998))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9950)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_9951))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2022-11-25 22:39:42,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744512000] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:39:42,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:39:42,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 56] total 81 [2022-11-25 22:39:42,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638123144] [2022-11-25 22:39:42,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:39:42,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-11-25 22:39:42,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:39:42,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-11-25 22:39:42,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=560, Unknown=102, NotChecked=9796, Total=10712 [2022-11-25 22:39:42,712 INFO L87 Difference]: Start difference. First operand 1613 states and 1779 transitions. Second operand has 82 states, 79 states have (on average 2.481012658227848) internal successors, (196), 82 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:39:44,723 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9906 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9906) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8934))) (exists ((v_ArrVal_9421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9421)))) is different from true [2022-11-25 22:39:44,814 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8934))) (exists ((v_ArrVal_9437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9437))) (exists ((v_ArrVal_9908 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9908) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8953))) (exists ((v_ArrVal_8951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8961))) (exists ((v_ArrVal_9448 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9448) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8959) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8970) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8966))) (exists ((v_ArrVal_9432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9432))) (exists ((v_ArrVal_9426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9426) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8954))) (exists ((v_ArrVal_8944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8944))) (exists ((v_ArrVal_9431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9431)))) is different from true [2022-11-25 22:40:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:40:21,644 INFO L93 Difference]: Finished difference Result 2646 states and 2900 transitions. [2022-11-25 22:40:21,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-25 22:40:21,645 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 79 states have (on average 2.481012658227848) internal successors, (196), 82 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 119 [2022-11-25 22:40:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:40:21,650 INFO L225 Difference]: With dead ends: 2646 [2022-11-25 22:40:21,650 INFO L226 Difference]: Without dead ends: 2646 [2022-11-25 22:40:21,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 217 SyntacticMatches, 76 SemanticMatches, 114 ConstructedPredicates, 81 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=367, Invalid=1033, Unknown=114, NotChecked=11826, Total=13340 [2022-11-25 22:40:21,652 INFO L413 NwaCegarLoop]: 907 mSDtfsCounter, 3158 mSDsluCounter, 5613 mSDsCounter, 0 mSdLazyCounter, 5495 mSolverCounterSat, 67 mSolverCounterUnsat, 1722 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3171 SdHoareTripleChecker+Valid, 6520 SdHoareTripleChecker+Invalid, 130585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 5495 IncrementalHoareTripleChecker+Invalid, 1722 IncrementalHoareTripleChecker+Unknown, 123301 IncrementalHoareTripleChecker+Unchecked, 37.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:40:21,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3171 Valid, 6520 Invalid, 130585 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 5495 Invalid, 1722 Unknown, 123301 Unchecked, 37.3s Time] [2022-11-25 22:40:21,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2022-11-25 22:40:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 1612. [2022-11-25 22:40:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1017 states have (on average 1.7246804326450345) internal successors, (1754), 1601 states have internal predecessors, (1754), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 22:40:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 1778 transitions. [2022-11-25 22:40:21,677 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 1778 transitions. Word has length 119 [2022-11-25 22:40:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:40:21,677 INFO L495 AbstractCegarLoop]: Abstraction has 1612 states and 1778 transitions. [2022-11-25 22:40:21,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 79 states have (on average 2.481012658227848) internal successors, (196), 82 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:40:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1778 transitions. [2022-11-25 22:40:21,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-25 22:40:21,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:40:21,679 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:40:21,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-25 22:40:21,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-11-25 22:40:22,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-25 22:40:22,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:40:22,296 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-25 22:40:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:40:22,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2088416095, now seen corresponding path program 1 times [2022-11-25 22:40:22,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:40:22,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843828112] [2022-11-25 22:40:22,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:40:22,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:40:22,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:40:22,299 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:40:22,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-11-25 22:40:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:40:23,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-25 22:40:23,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:40:23,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:40:24,071 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:40:24,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:40:24,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:40:24,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:40:24,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:40:24,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 22:40:24,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:40:24,640 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10398 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10398))) (exists ((v_ArrVal_10397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10397)))) is different from true [2022-11-25 22:40:24,669 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10399))) (exists ((v_ArrVal_10400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10400) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:24,895 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10407))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10408) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:40:24,922 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10409))) (exists ((v_ArrVal_10410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10410)))) is different from true [2022-11-25 22:40:24,950 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10412) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:24,976 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10413))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10414)))) is different from true [2022-11-25 22:40:25,003 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10415))) (exists ((v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10416))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:25,029 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10417))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10418)))) is different from true [2022-11-25 22:40:25,056 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10420))) (exists ((v_ArrVal_10419 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10419) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:25,082 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10422 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10422))) (exists ((v_ArrVal_10421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10421) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:25,110 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10423) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10424)))) is different from true [2022-11-25 22:40:25,137 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10425))) (exists ((v_ArrVal_10426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10426))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:25,164 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10428))) (exists ((v_ArrVal_10427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10427)))) is different from true [2022-11-25 22:40:25,191 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10429 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10429) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10430)))) is different from true [2022-11-25 22:40:25,217 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10431 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10431) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_10432 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10432) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:40:25,245 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10434))) (exists ((v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10433) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:40:25,271 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10435))) (exists ((v_ArrVal_10436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10436))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:25,297 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10437 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10437) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10438 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10438) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:40:25,324 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10439))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10440) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:40:25,351 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10441))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10442)))) is different from true [2022-11-25 22:40:25,398 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10443))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10444)))) is different from true [2022-11-25 22:40:25,424 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10445))) (exists ((v_ArrVal_10446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10446))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:25,452 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10448))) (exists ((v_ArrVal_10447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10447))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:25,479 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10450))) (exists ((v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10449)))) is different from true [2022-11-25 22:40:25,507 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10452) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10451)))) is different from true [2022-11-25 22:40:25,535 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10454))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10453)))) is different from true [2022-11-25 22:40:25,561 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10456))) (exists ((v_ArrVal_10455 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10455) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:25,588 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10458))) (exists ((v_ArrVal_10457 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10457) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:25,614 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10460) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10459) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:40:25,640 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10461) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10462)))) is different from true [2022-11-25 22:40:25,667 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10464) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10463)))) is different from true [2022-11-25 22:40:25,695 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10466))) (exists ((v_ArrVal_10465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10465)))) is different from true [2022-11-25 22:40:25,722 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10468))) (exists ((v_ArrVal_10467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10467) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:25,749 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10470))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10469 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10469) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:40:25,776 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10472 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10472) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10471) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:25,802 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10474))) (exists ((v_ArrVal_10473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10473))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:25,829 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10476))) (exists ((v_ArrVal_10475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10475) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:25,855 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10478) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10477) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:40:25,883 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10480))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10479) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:40:25,916 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10482))) (exists ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10481))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-25 22:40:26,009 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:40:26,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:40:26,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:40:26,262 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:40:26,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:40:26,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:40:26,491 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:40:26,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:40:26,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:40:26,729 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:40:26,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:40:26,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:40:26,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:40:26,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:40:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 980 not checked. [2022-11-25 22:40:26,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:40:27,238 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10488) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2022-11-25 22:40:27,293 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10488) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2022-11-25 22:40:27,373 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10485) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10486))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10485) .cse2 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_10488) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-25 22:40:27,440 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10485) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10486))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10485) .cse3 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10488) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-25 22:40:28,487 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10484))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10483) .cse1 v_ArrVal_10485) (select (select (store .cse2 .cse1 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10487))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10484))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10486))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10483) .cse4 v_ArrVal_10485) .cse5 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10488) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-25 22:40:30,197 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10484))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10483) .cse2 v_ArrVal_10485) (select (select (store .cse3 .cse2 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10487))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10484))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10486))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10483) .cse5 v_ArrVal_10485) .cse6 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10488) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2022-11-25 22:40:33,965 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10579))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10484))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10486))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10580) .cse0 v_ArrVal_10483) .cse1 v_ArrVal_10485) .cse2 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10488) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10579))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10484))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10580) .cse8 v_ArrVal_10483) .cse9 v_ArrVal_10485) (select (select (store .cse10 .cse9 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10487))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2022-11-25 22:40:33,991 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:40:33,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843828112] [2022-11-25 22:40:33,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843828112] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:40:33,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1189821385] [2022-11-25 22:40:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:40:33,991 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:40:33,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:40:33,992 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:40:33,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2dc60cf-c715-4807-941c-76246adecc13/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process