./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS --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 9a343b75818c5d561b79c31bb62e9abdd9bdb0bf3f01f7efa313d9ef0f4204f4 --- 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-8393723 [2022-11-19 08:20:18,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:20:18,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:20:18,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:20:18,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:20:18,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:20:18,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:20:18,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:20:18,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:20:18,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:20:18,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:20:18,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:20:18,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:20:18,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:20:18,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:20:18,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:20:18,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:20:18,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:20:18,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:20:18,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:20:18,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:20:18,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:20:18,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:20:18,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:20:18,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:20:18,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:20:18,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:20:18,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:20:18,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:20:18,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:20:18,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:20:18,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:20:18,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:20:18,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:20:18,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:20:18,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:20:18,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:20:18,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:20:18,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:20:18,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:20:18,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:20:18,170 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 08:20:18,208 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:20:18,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:20:18,209 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:20:18,209 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:20:18,210 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:20:18,211 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:20:18,211 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:20:18,211 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:20:18,211 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:20:18,211 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:20:18,212 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:20:18,213 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:20:18,213 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:20:18,213 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:20:18,213 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:20:18,214 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:20:18,214 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:20:18,214 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:20:18,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:20:18,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:20:18,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:20:18,217 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:20:18,217 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:20:18,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:20:18,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:20:18,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:20:18,218 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:20:18,231 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:20:18,231 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:20:18,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:20:18,232 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:20:18,232 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:20:18,232 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:20:18,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:20:18,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:20:18,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:20:18,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:20:18,233 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:20:18,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:20:18,234 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:20:18,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:20:18,234 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:20:18,234 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_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS 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 -> 9a343b75818c5d561b79c31bb62e9abdd9bdb0bf3f01f7efa313d9ef0f4204f4 [2022-11-19 08:20:18,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:20:18,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:20:18,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:20:18,624 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:20:18,625 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:20:18,626 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i [2022-11-19 08:20:18,700 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/data/25cde0011/77c40975f4104cf0a063f1e825c717af/FLAG17369c2aa [2022-11-19 08:20:19,525 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:20:19,526 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i [2022-11-19 08:20:19,543 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/data/25cde0011/77c40975f4104cf0a063f1e825c717af/FLAG17369c2aa [2022-11-19 08:20:19,674 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/data/25cde0011/77c40975f4104cf0a063f1e825c717af [2022-11-19 08:20:19,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:20:19,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:20:19,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:20:19,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:20:19,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:20:19,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:20:19" (1/1) ... [2022-11-19 08:20:19,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478c568f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:19, skipping insertion in model container [2022-11-19 08:20:19,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:20:19" (1/1) ... [2022-11-19 08:20:19,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:20:19,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:20:20,392 WARN L234 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_c9762e56-ee3f-43c1-9cb0-f1413785cf77/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i[33022,33035] [2022-11-19 08:20:20,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:20:20,711 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-19 08:20:20,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@67f9616f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:20, skipping insertion in model container [2022-11-19 08:20:20,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:20:20,713 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-19 08:20:20,715 INFO L158 Benchmark]: Toolchain (without parser) took 1035.65ms. Allocated memory is still 115.3MB. Free memory was 69.2MB in the beginning and 70.4MB in the end (delta: -1.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-11-19 08:20:20,716 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 115.3MB. Free memory was 89.0MB in the beginning and 88.9MB in the end (delta: 69.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:20:20,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1030.05ms. Allocated memory is still 115.3MB. Free memory was 69.0MB in the beginning and 70.4MB in the end (delta: -1.4MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-11-19 08:20:20,720 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.24ms. Allocated memory is still 115.3MB. Free memory was 89.0MB in the beginning and 88.9MB in the end (delta: 69.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1030.05ms. Allocated memory is still 115.3MB. Free memory was 69.0MB in the beginning and 70.4MB in the end (delta: -1.4MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS --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 9a343b75818c5d561b79c31bb62e9abdd9bdb0bf3f01f7efa313d9ef0f4204f4 --- 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-8393723 [2022-11-19 08:20:22,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:20:22,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:20:23,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:20:23,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:20:23,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:20:23,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:20:23,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:20:23,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:20:23,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:20:23,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:20:23,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:20:23,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:20:23,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:20:23,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:20:23,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:20:23,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:20:23,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:20:23,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:20:23,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:20:23,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:20:23,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:20:23,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:20:23,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:20:23,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:20:23,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:20:23,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:20:23,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:20:23,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:20:23,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:20:23,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:20:23,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:20:23,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:20:23,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:20:23,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:20:23,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:20:23,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:20:23,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:20:23,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:20:23,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:20:23,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:20:23,080 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 08:20:23,123 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:20:23,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:20:23,125 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:20:23,125 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:20:23,126 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:20:23,127 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:20:23,127 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:20:23,127 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:20:23,128 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:20:23,128 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:20:23,129 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:20:23,129 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:20:23,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:20:23,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:20:23,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:20:23,132 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:20:23,132 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:20:23,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:20:23,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:20:23,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:20:23,133 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:20:23,133 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:20:23,134 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:20:23,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:20:23,134 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:20:23,135 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 08:20:23,135 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 08:20:23,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:20:23,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:20:23,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:20:23,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 08:20:23,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:20:23,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:20:23,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:20:23,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:20:23,138 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 08:20:23,138 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 08:20:23,139 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:20:23,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 08:20:23,139 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_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS 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 -> 9a343b75818c5d561b79c31bb62e9abdd9bdb0bf3f01f7efa313d9ef0f4204f4 [2022-11-19 08:20:23,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:20:23,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:20:23,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:20:23,595 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:20:23,596 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:20:23,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i [2022-11-19 08:20:23,675 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/data/4f26d6119/ac4fd08693e0472b9a8710220dbaa859/FLAG14312a7b8 [2022-11-19 08:20:24,490 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:20:24,491 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i [2022-11-19 08:20:24,514 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/data/4f26d6119/ac4fd08693e0472b9a8710220dbaa859/FLAG14312a7b8 [2022-11-19 08:20:24,574 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/data/4f26d6119/ac4fd08693e0472b9a8710220dbaa859 [2022-11-19 08:20:24,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:20:24,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:20:24,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:20:24,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:20:24,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:20:24,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:20:24" (1/1) ... [2022-11-19 08:20:24,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f9c2112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:24, skipping insertion in model container [2022-11-19 08:20:24,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:20:24" (1/1) ... [2022-11-19 08:20:24,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:20:24,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:20:25,220 WARN L234 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_c9762e56-ee3f-43c1-9cb0-f1413785cf77/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i[33022,33035] [2022-11-19 08:20:25,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:20:25,475 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-19 08:20:25,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:20:25,547 WARN L234 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_c9762e56-ee3f-43c1-9cb0-f1413785cf77/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i[33022,33035] [2022-11-19 08:20:25,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:20:25,723 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:20:25,759 WARN L234 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_c9762e56-ee3f-43c1-9cb0-f1413785cf77/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i[33022,33035] [2022-11-19 08:20:25,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:20:25,956 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:20:25,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:25 WrapperNode [2022-11-19 08:20:25,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:20:25,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:20:25,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:20:25,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:20:25,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:25" (1/1) ... [2022-11-19 08:20:26,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:25" (1/1) ... [2022-11-19 08:20:26,168 INFO L138 Inliner]: procedures = 180, calls = 575, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2340 [2022-11-19 08:20:26,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:20:26,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:20:26,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:20:26,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:20:26,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:25" (1/1) ... [2022-11-19 08:20:26,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:25" (1/1) ... [2022-11-19 08:20:26,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:25" (1/1) ... [2022-11-19 08:20:26,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:25" (1/1) ... [2022-11-19 08:20:26,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:25" (1/1) ... [2022-11-19 08:20:26,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:25" (1/1) ... [2022-11-19 08:20:26,343 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:25" (1/1) ... [2022-11-19 08:20:26,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:25" (1/1) ... [2022-11-19 08:20:26,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:20:26,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:20:26,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:20:26,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:20:26,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:25" (1/1) ... [2022-11-19 08:20:26,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:20:26,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:20:26,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:20:26,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:20:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-19 08:20:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2022-11-19 08:20:26,523 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2022-11-19 08:20:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-19 08:20:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-19 08:20:26,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-19 08:20:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-19 08:20:26,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-19 08:20:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 08:20:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:20:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 08:20:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:20:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-19 08:20:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 08:20:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:20:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 08:20:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 08:20:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:20:26,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:20:26,950 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:20:26,952 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:20:26,955 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-19 08:20:37,301 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:20:37,325 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:20:37,330 INFO L300 CfgBuilder]: Removed 160 assume(true) statements. [2022-11-19 08:20:37,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:20:37 BoogieIcfgContainer [2022-11-19 08:20:37,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:20:37,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:20:37,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:20:37,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:20:37,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:20:24" (1/3) ... [2022-11-19 08:20:37,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223bb3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:20:37, skipping insertion in model container [2022-11-19 08:20:37,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:20:25" (2/3) ... [2022-11-19 08:20:37,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223bb3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:20:37, skipping insertion in model container [2022-11-19 08:20:37,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:20:37" (3/3) ... [2022-11-19 08:20:37,346 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-2.i [2022-11-19 08:20:37,364 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:20:37,364 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1095 error locations. [2022-11-19 08:20:37,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:20:37,473 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;@684da7af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:20:37,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1095 error locations. [2022-11-19 08:20:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 2257 states, 1150 states have (on average 2.214782608695652) internal successors, (2547), 2243 states have internal predecessors, (2547), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-19 08:20:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 08:20:37,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:20:37,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 08:20:37,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:20:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:20:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2022-11-19 08:20:37,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:20:37,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679704031] [2022-11-19 08:20:37,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:20:37,513 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-19 08:20:37,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:20:37,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:20:37,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:20:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:20:37,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:20:37,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:20:37,891 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-19 08:20:37,905 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-19 08:20:37,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:20:37,906 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:20:37,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679704031] [2022-11-19 08:20:37,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679704031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:20:37,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:20:37,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:20:37,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002511022] [2022-11-19 08:20:37,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:20:37,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:20:37,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:20:37,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:20:37,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:20:37,947 INFO L87 Difference]: Start difference. First operand has 2257 states, 1150 states have (on average 2.214782608695652) internal successors, (2547), 2243 states have internal predecessors, (2547), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:20:43,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:20:43,228 INFO L93 Difference]: Finished difference Result 2931 states and 3114 transitions. [2022-11-19 08:20:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:20:43,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-19 08:20:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:20:43,256 INFO L225 Difference]: With dead ends: 2931 [2022-11-19 08:20:43,256 INFO L226 Difference]: Without dead ends: 2929 [2022-11-19 08:20:43,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:20:43,261 INFO L413 NwaCegarLoop]: 1390 mSDtfsCounter, 2138 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2148 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:20:43,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2148 Valid, 1863 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-19 08:20:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2022-11-19 08:20:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2399. [2022-11-19 08:20:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 1316 states have (on average 2.0516717325227964) internal successors, (2700), 2383 states have internal predecessors, (2700), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:20:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 2732 transitions. [2022-11-19 08:20:43,372 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 2732 transitions. Word has length 3 [2022-11-19 08:20:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:20:43,373 INFO L495 AbstractCegarLoop]: Abstraction has 2399 states and 2732 transitions. [2022-11-19 08:20:43,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:20:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 2732 transitions. [2022-11-19 08:20:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 08:20:43,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:20:43,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 08:20:43,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:20:43,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:20:43,586 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:20:43,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:20:43,587 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2022-11-19 08:20:43,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:20:43,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883934930] [2022-11-19 08:20:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:20:43,588 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-19 08:20:43,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:20:43,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:20:43,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:20:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:20:43,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:20:43,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:20:43,809 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-19 08:20:43,824 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-19 08:20:43,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:20:43,826 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:20:43,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883934930] [2022-11-19 08:20:43,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883934930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:20:43,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:20:43,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:20:43,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571422436] [2022-11-19 08:20:43,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:20:43,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:20:43,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:20:43,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:20:43,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:20:43,838 INFO L87 Difference]: Start difference. First operand 2399 states and 2732 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:20:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:20:51,096 INFO L93 Difference]: Finished difference Result 3369 states and 3794 transitions. [2022-11-19 08:20:51,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:20:51,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-19 08:20:51,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:20:51,108 INFO L225 Difference]: With dead ends: 3369 [2022-11-19 08:20:51,108 INFO L226 Difference]: Without dead ends: 3369 [2022-11-19 08:20:51,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:20:51,110 INFO L413 NwaCegarLoop]: 1947 mSDtfsCounter, 1054 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:20:51,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 3237 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-11-19 08:20:51,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states. [2022-11-19 08:20:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 2848. [2022-11-19 08:20:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 1763 states have (on average 2.0096426545660804) internal successors, (3543), 2829 states have internal predecessors, (3543), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 08:20:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3581 transitions. [2022-11-19 08:20:51,196 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3581 transitions. Word has length 3 [2022-11-19 08:20:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:20:51,196 INFO L495 AbstractCegarLoop]: Abstraction has 2848 states and 3581 transitions. [2022-11-19 08:20:51,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:20:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3581 transitions. [2022-11-19 08:20:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 08:20:51,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:20:51,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:20:51,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:20:51,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:20:51,409 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:20:51,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:20:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2022-11-19 08:20:51,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:20:51,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612571827] [2022-11-19 08:20:51,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:20:51,411 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-19 08:20:51,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:20:51,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:20:51,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:20:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:20:51,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 08:20:51,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:20:51,661 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-19 08:20:51,667 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-19 08:20:51,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:20:51,726 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-19 08:20:51,743 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:20:51,743 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-19 08:20:51,765 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-19 08:20:51,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:20:51,765 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:20:51,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612571827] [2022-11-19 08:20:51,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612571827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:20:51,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:20:51,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:20:51,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985580493] [2022-11-19 08:20:51,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:20:51,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:20:51,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:20:51,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:20:51,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:20:51,768 INFO L87 Difference]: Start difference. First operand 2848 states and 3581 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:04,307 INFO L93 Difference]: Finished difference Result 5477 states and 6380 transitions. [2022-11-19 08:21:04,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:21:04,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-19 08:21:04,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:04,322 INFO L225 Difference]: With dead ends: 5477 [2022-11-19 08:21:04,323 INFO L226 Difference]: Without dead ends: 5477 [2022-11-19 08:21:04,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:21:04,324 INFO L413 NwaCegarLoop]: 843 mSDtfsCounter, 4880 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 3103 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4890 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 3146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:21:04,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4890 Valid, 2299 Invalid, 3146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3103 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2022-11-19 08:21:04,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2022-11-19 08:21:04,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 3565. [2022-11-19 08:21:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3565 states, 2480 states have (on average 2.042741935483871) internal successors, (5066), 3540 states have internal predecessors, (5066), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:21:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 5116 transitions. [2022-11-19 08:21:04,426 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 5116 transitions. Word has length 7 [2022-11-19 08:21:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:04,426 INFO L495 AbstractCegarLoop]: Abstraction has 3565 states and 5116 transitions. [2022-11-19 08:21:04,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 5116 transitions. [2022-11-19 08:21:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-19 08:21:04,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:04,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:21:04,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:04,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:04,644 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:21:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:04,645 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2022-11-19 08:21:04,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:21:04,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385933217] [2022-11-19 08:21:04,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:04,646 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-19 08:21:04,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:21:04,647 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:04,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:04,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:21:04,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:04,877 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-19 08:21:04,889 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-19 08:21:04,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:21:04,889 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:21:04,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385933217] [2022-11-19 08:21:04,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385933217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:21:04,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:21:04,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:21:04,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213065689] [2022-11-19 08:21:04,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:21:04,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:21:04,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:21:04,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:21:04,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:21:04,892 INFO L87 Difference]: Start difference. First operand 3565 states and 5116 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:09,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:09,356 INFO L93 Difference]: Finished difference Result 4769 states and 6633 transitions. [2022-11-19 08:21:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:21:09,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-19 08:21:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:09,371 INFO L225 Difference]: With dead ends: 4769 [2022-11-19 08:21:09,371 INFO L226 Difference]: Without dead ends: 4769 [2022-11-19 08:21:09,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:21:09,372 INFO L413 NwaCegarLoop]: 2173 mSDtfsCounter, 1994 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:21:09,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2004 Valid, 2929 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-19 08:21:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2022-11-19 08:21:09,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 3474. [2022-11-19 08:21:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3474 states, 2480 states have (on average 1.9568548387096774) internal successors, (4853), 3449 states have internal predecessors, (4853), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:21:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 4903 transitions. [2022-11-19 08:21:09,455 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 4903 transitions. Word has length 8 [2022-11-19 08:21:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:09,455 INFO L495 AbstractCegarLoop]: Abstraction has 3474 states and 4903 transitions. [2022-11-19 08:21:09,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 4903 transitions. [2022-11-19 08:21:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-19 08:21:09,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:09,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:21:09,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:09,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:09,668 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:21:09,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:09,668 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2022-11-19 08:21:09,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:21:09,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233128226] [2022-11-19 08:21:09,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:09,669 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-19 08:21:09,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:21:09,671 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:09,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:09,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:21:09,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:09,884 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-19 08:21:09,910 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-19 08:21:09,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:21:09,911 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:21:09,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233128226] [2022-11-19 08:21:09,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233128226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:21:09,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:21:09,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:21:09,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419418811] [2022-11-19 08:21:09,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:21:09,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:21:09,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:21:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:21:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:21:09,914 INFO L87 Difference]: Start difference. First operand 3474 states and 4903 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:17,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:17,064 INFO L93 Difference]: Finished difference Result 5189 states and 7261 transitions. [2022-11-19 08:21:17,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:21:17,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-19 08:21:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:17,080 INFO L225 Difference]: With dead ends: 5189 [2022-11-19 08:21:17,080 INFO L226 Difference]: Without dead ends: 5189 [2022-11-19 08:21:17,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:21:17,081 INFO L413 NwaCegarLoop]: 2553 mSDtfsCounter, 1369 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3640 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:21:17,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 3640 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-11-19 08:21:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2022-11-19 08:21:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 3796. [2022-11-19 08:21:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 2812 states have (on average 1.943456614509246) internal successors, (5465), 3771 states have internal predecessors, (5465), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:21:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 5515 transitions. [2022-11-19 08:21:17,163 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 5515 transitions. Word has length 8 [2022-11-19 08:21:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:17,163 INFO L495 AbstractCegarLoop]: Abstraction has 3796 states and 5515 transitions. [2022-11-19 08:21:17,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 5515 transitions. [2022-11-19 08:21:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 08:21:17,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:17,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:21:17,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:17,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:17,377 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:21:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:17,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1045354379, now seen corresponding path program 1 times [2022-11-19 08:21:17,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:21:17,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912796799] [2022-11-19 08:21:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:17,378 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-19 08:21:17,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:21:17,378 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:17,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:17,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:21:17,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:17,620 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-19 08:21:17,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:21:17,620 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:21:17,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912796799] [2022-11-19 08:21:17,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912796799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:21:17,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:21:17,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:21:17,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245286425] [2022-11-19 08:21:17,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:21:17,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:21:17,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:21:17,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:21:17,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:21:17,623 INFO L87 Difference]: Start difference. First operand 3796 states and 5515 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-19 08:21:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:17,670 INFO L93 Difference]: Finished difference Result 3736 states and 5429 transitions. [2022-11-19 08:21:17,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:21:17,671 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-19 08:21:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:17,691 INFO L225 Difference]: With dead ends: 3736 [2022-11-19 08:21:17,691 INFO L226 Difference]: Without dead ends: 3736 [2022-11-19 08:21:17,692 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-19 08:21:17,694 INFO L413 NwaCegarLoop]: 2217 mSDtfsCounter, 1011 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 3429 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-19 08:21:17,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 3429 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:21:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2022-11-19 08:21:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3736. [2022-11-19 08:21:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3736 states, 2776 states have (on average 1.9376801152737753) internal successors, (5379), 3711 states have internal predecessors, (5379), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:21:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 5429 transitions. [2022-11-19 08:21:17,764 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 5429 transitions. Word has length 11 [2022-11-19 08:21:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:17,764 INFO L495 AbstractCegarLoop]: Abstraction has 3736 states and 5429 transitions. [2022-11-19 08:21:17,765 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-19 08:21:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 5429 transitions. [2022-11-19 08:21:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:21:17,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:17,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:21:17,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:17,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:17,977 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:21:17,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash 436842575, now seen corresponding path program 1 times [2022-11-19 08:21:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:21:17,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173351749] [2022-11-19 08:21:17,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:17,982 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-19 08:21:17,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:21:17,983 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:17,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:18,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:21:18,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:18,252 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-19 08:21:18,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:21:18,252 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:21:18,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173351749] [2022-11-19 08:21:18,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173351749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:21:18,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:21:18,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:21:18,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764375193] [2022-11-19 08:21:18,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:21:18,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:21:18,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:21:18,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:21:18,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:21:18,255 INFO L87 Difference]: Start difference. First operand 3736 states and 5429 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-19 08:21:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:18,372 INFO L93 Difference]: Finished difference Result 3708 states and 5373 transitions. [2022-11-19 08:21:18,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:21:18,373 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-19 08:21:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:18,393 INFO L225 Difference]: With dead ends: 3708 [2022-11-19 08:21:18,393 INFO L226 Difference]: Without dead ends: 3708 [2022-11-19 08:21:18,393 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-19 08:21:18,395 INFO L413 NwaCegarLoop]: 2172 mSDtfsCounter, 992 mSDsluCounter, 3377 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 5549 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-19 08:21:18,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 5549 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:21:18,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2022-11-19 08:21:18,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 3706. [2022-11-19 08:21:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3706 states, 2760 states have (on average 1.9278985507246378) internal successors, (5321), 3681 states have internal predecessors, (5321), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:21:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5371 transitions. [2022-11-19 08:21:18,464 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5371 transitions. Word has length 13 [2022-11-19 08:21:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:18,465 INFO L495 AbstractCegarLoop]: Abstraction has 3706 states and 5371 transitions. [2022-11-19 08:21:18,465 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-19 08:21:18,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5371 transitions. [2022-11-19 08:21:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 08:21:18,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:18,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:21:18,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:18,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:18,679 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:21:18,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:18,679 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2022-11-19 08:21:18,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:21:18,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318756953] [2022-11-19 08:21:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:18,680 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-19 08:21:18,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:21:18,682 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:18,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:18,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:21:18,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:18,956 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-19 08:21:18,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:21:18,956 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:21:18,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318756953] [2022-11-19 08:21:18,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318756953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:21:18,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:21:18,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:21:18,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729062262] [2022-11-19 08:21:18,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:21:18,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:21:18,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:21:18,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:21:18,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:21:18,959 INFO L87 Difference]: Start difference. First operand 3706 states and 5371 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:19,032 INFO L93 Difference]: Finished difference Result 5153 states and 6936 transitions. [2022-11-19 08:21:19,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:21:19,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-19 08:21:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:19,044 INFO L225 Difference]: With dead ends: 5153 [2022-11-19 08:21:19,045 INFO L226 Difference]: Without dead ends: 5153 [2022-11-19 08:21:19,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:21:19,046 INFO L413 NwaCegarLoop]: 3713 mSDtfsCounter, 2098 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2108 SdHoareTripleChecker+Valid, 5327 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-19 08:21:19,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2108 Valid, 5327 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:21:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5153 states. [2022-11-19 08:21:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5153 to 3646. [2022-11-19 08:21:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3646 states, 2724 states have (on average 1.921806167400881) internal successors, (5235), 3621 states have internal predecessors, (5235), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:21:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3646 states and 5285 transitions. [2022-11-19 08:21:19,159 INFO L78 Accepts]: Start accepts. Automaton has 3646 states and 5285 transitions. Word has length 20 [2022-11-19 08:21:19,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:19,160 INFO L495 AbstractCegarLoop]: Abstraction has 3646 states and 5285 transitions. [2022-11-19 08:21:19,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3646 states and 5285 transitions. [2022-11-19 08:21:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 08:21:19,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:19,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:21:19,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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)] Ended with exit code 0 [2022-11-19 08:21:19,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:19,362 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:21:19,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:19,362 INFO L85 PathProgramCache]: Analyzing trace with hash 413623007, now seen corresponding path program 1 times [2022-11-19 08:21:19,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:21:19,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470285682] [2022-11-19 08:21:19,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:19,363 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-19 08:21:19,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:21:19,365 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:19,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:19,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:21:19,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:19,653 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-19 08:21:19,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:21:19,654 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:21:19,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470285682] [2022-11-19 08:21:19,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470285682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:21:19,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:21:19,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:21:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779217780] [2022-11-19 08:21:19,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:21:19,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:21:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:21:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:21:19,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:21:19,657 INFO L87 Difference]: Start difference. First operand 3646 states and 5285 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:19,725 INFO L93 Difference]: Finished difference Result 4986 states and 6645 transitions. [2022-11-19 08:21:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:21:19,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-19 08:21:19,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:19,739 INFO L225 Difference]: With dead ends: 4986 [2022-11-19 08:21:19,739 INFO L226 Difference]: Without dead ends: 4986 [2022-11-19 08:21:19,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:21:19,742 INFO L413 NwaCegarLoop]: 3622 mSDtfsCounter, 2055 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2065 SdHoareTripleChecker+Valid, 5188 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-19 08:21:19,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2065 Valid, 5188 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:21:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4986 states. [2022-11-19 08:21:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4986 to 3514. [2022-11-19 08:21:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3514 states, 2616 states have (on average 1.9025229357798166) internal successors, (4977), 3489 states have internal predecessors, (4977), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:21:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 5027 transitions. [2022-11-19 08:21:19,805 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 5027 transitions. Word has length 20 [2022-11-19 08:21:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:19,806 INFO L495 AbstractCegarLoop]: Abstraction has 3514 states and 5027 transitions. [2022-11-19 08:21:19,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 5027 transitions. [2022-11-19 08:21:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:21:19,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:19,808 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] [2022-11-19 08:21:19,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:20,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:20,008 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:21:20,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:20,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2022-11-19 08:21:20,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:21:20,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32881972] [2022-11-19 08:21:20,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:20,009 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-19 08:21:20,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:21:20,013 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:20,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:20,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:21:20,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:20,287 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-19 08:21:20,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:21:20,288 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:21:20,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32881972] [2022-11-19 08:21:20,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32881972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:21:20,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:21:20,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:21:20,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697980974] [2022-11-19 08:21:20,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:21:20,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:21:20,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:21:20,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:21:20,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:21:20,290 INFO L87 Difference]: Start difference. First operand 3514 states and 5027 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:20,437 INFO L93 Difference]: Finished difference Result 4951 states and 6579 transitions. [2022-11-19 08:21:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:21:20,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 08:21:20,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:20,448 INFO L225 Difference]: With dead ends: 4951 [2022-11-19 08:21:20,448 INFO L226 Difference]: Without dead ends: 4951 [2022-11-19 08:21:20,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:21:20,449 INFO L413 NwaCegarLoop]: 3582 mSDtfsCounter, 2036 mSDsluCounter, 5146 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2046 SdHoareTripleChecker+Valid, 8728 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-19 08:21:20,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2046 Valid, 8728 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:21:20,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2022-11-19 08:21:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 3484. [2022-11-19 08:21:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 2600 states have (on average 1.8919230769230768) internal successors, (4919), 3459 states have internal predecessors, (4919), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:21:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 4969 transitions. [2022-11-19 08:21:20,510 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 4969 transitions. Word has length 22 [2022-11-19 08:21:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:20,511 INFO L495 AbstractCegarLoop]: Abstraction has 3484 states and 4969 transitions. [2022-11-19 08:21:20,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 4969 transitions. [2022-11-19 08:21:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:21:20,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:20,512 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] [2022-11-19 08:21:20,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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)] Ended with exit code 0 [2022-11-19 08:21:20,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:20,726 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr358REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:21:20,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:20,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1940223495, now seen corresponding path program 1 times [2022-11-19 08:21:20,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:21:20,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493041071] [2022-11-19 08:21:20,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:20,727 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-19 08:21:20,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:21:20,728 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:20,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:20,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:21:20,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:21,015 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-19 08:21:21,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:21:21,015 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:21:21,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493041071] [2022-11-19 08:21:21,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493041071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:21:21,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:21:21,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:21:21,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125025755] [2022-11-19 08:21:21,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:21:21,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:21:21,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:21:21,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:21:21,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:21:21,018 INFO L87 Difference]: Start difference. First operand 3484 states and 4969 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:21,114 INFO L93 Difference]: Finished difference Result 4878 states and 6390 transitions. [2022-11-19 08:21:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:21:21,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 08:21:21,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:21,125 INFO L225 Difference]: With dead ends: 4878 [2022-11-19 08:21:21,125 INFO L226 Difference]: Without dead ends: 4878 [2022-11-19 08:21:21,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:21:21,126 INFO L413 NwaCegarLoop]: 3507 mSDtfsCounter, 2001 mSDsluCounter, 5031 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 8538 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-19 08:21:21,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 8538 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:21:21,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2022-11-19 08:21:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 3422. [2022-11-19 08:21:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3422 states, 2552 states have (on average 1.8593260188087775) internal successors, (4745), 3397 states have internal predecessors, (4745), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:21:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 4795 transitions. [2022-11-19 08:21:21,201 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 4795 transitions. Word has length 22 [2022-11-19 08:21:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:21,202 INFO L495 AbstractCegarLoop]: Abstraction has 3422 states and 4795 transitions. [2022-11-19 08:21:21,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 4795 transitions. [2022-11-19 08:21:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 08:21:21,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:21,203 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-19 08:21:21,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:21,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:21,415 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:21:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash 558613821, now seen corresponding path program 1 times [2022-11-19 08:21:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:21:21,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413587308] [2022-11-19 08:21:21,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:21,417 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-19 08:21:21,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:21:21,418 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:21,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:21,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:21:21,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:21,653 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-19 08:21:21,725 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-19 08:21:21,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:21:21,725 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:21:21,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413587308] [2022-11-19 08:21:21,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413587308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:21:21,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:21:21,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:21:21,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537487506] [2022-11-19 08:21:21,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:21:21,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:21:21,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:21:21,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:21:21,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:21:21,728 INFO L87 Difference]: Start difference. First operand 3422 states and 4795 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-19 08:21:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:26,555 INFO L93 Difference]: Finished difference Result 3873 states and 5152 transitions. [2022-11-19 08:21:26,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:21:26,556 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-19 08:21:26,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:26,564 INFO L225 Difference]: With dead ends: 3873 [2022-11-19 08:21:26,564 INFO L226 Difference]: Without dead ends: 3873 [2022-11-19 08:21:26,564 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-19 08:21:26,565 INFO L413 NwaCegarLoop]: 1240 mSDtfsCounter, 2741 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2747 SdHoareTripleChecker+Valid, 2332 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:21:26,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2747 Valid, 2332 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-19 08:21:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3873 states. [2022-11-19 08:21:26,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3873 to 3418. [2022-11-19 08:21:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3418 states, 2552 states have (on average 1.8561912225705328) internal successors, (4737), 3393 states have internal predecessors, (4737), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:21:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 4787 transitions. [2022-11-19 08:21:26,619 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 4787 transitions. Word has length 27 [2022-11-19 08:21:26,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:26,620 INFO L495 AbstractCegarLoop]: Abstraction has 3418 states and 4787 transitions. [2022-11-19 08:21:26,620 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-19 08:21:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 4787 transitions. [2022-11-19 08:21:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 08:21:26,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:26,621 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-19 08:21:26,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:26,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:26,832 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:21:26,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:26,833 INFO L85 PathProgramCache]: Analyzing trace with hash 558613822, now seen corresponding path program 1 times [2022-11-19 08:21:26,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:21:26,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359721565] [2022-11-19 08:21:26,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:26,834 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-19 08:21:26,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:21:26,835 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:26,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:27,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:21:27,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:27,098 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-19 08:21:27,310 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-19 08:21:27,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:21:27,310 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:21:27,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359721565] [2022-11-19 08:21:27,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359721565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:21:27,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:21:27,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:21:27,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684330728] [2022-11-19 08:21:27,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:21:27,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:21:27,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:21:27,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:21:27,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:21:27,313 INFO L87 Difference]: Start difference. First operand 3418 states and 4787 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-19 08:21:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:35,236 INFO L93 Difference]: Finished difference Result 4319 states and 5771 transitions. [2022-11-19 08:21:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:21:35,237 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-19 08:21:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:35,246 INFO L225 Difference]: With dead ends: 4319 [2022-11-19 08:21:35,246 INFO L226 Difference]: Without dead ends: 4319 [2022-11-19 08:21:35,246 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-19 08:21:35,247 INFO L413 NwaCegarLoop]: 1650 mSDtfsCounter, 1908 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 3805 SdHoareTripleChecker+Invalid, 2310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-19 08:21:35,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 3805 Invalid, 2310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-11-19 08:21:35,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2022-11-19 08:21:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 3454. [2022-11-19 08:21:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 2588 states have (on average 1.8462132921174652) internal successors, (4778), 3429 states have internal predecessors, (4778), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:21:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4828 transitions. [2022-11-19 08:21:35,299 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4828 transitions. Word has length 27 [2022-11-19 08:21:35,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:35,300 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4828 transitions. [2022-11-19 08:21:35,300 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-19 08:21:35,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4828 transitions. [2022-11-19 08:21:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 08:21:35,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:35,301 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] [2022-11-19 08:21:35,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:35,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:35,513 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:21:35,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2022-11-19 08:21:35,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:21:35,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835819553] [2022-11-19 08:21:35,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:35,514 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-19 08:21:35,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:21:35,515 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:35,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:35,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:21:35,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:35,831 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-19 08:21:35,922 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-19 08:21:35,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:21:35,923 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:21:35,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835819553] [2022-11-19 08:21:35,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835819553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:21:35,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:21:35,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:21:35,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992174727] [2022-11-19 08:21:35,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:21:35,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:21:35,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:21:35,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:21:35,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:21:35,925 INFO L87 Difference]: Start difference. First operand 3454 states and 4828 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:43,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:43,138 INFO L93 Difference]: Finished difference Result 6680 states and 9181 transitions. [2022-11-19 08:21:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:21:43,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-19 08:21:43,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:43,149 INFO L225 Difference]: With dead ends: 6680 [2022-11-19 08:21:43,150 INFO L226 Difference]: Without dead ends: 6680 [2022-11-19 08:21:43,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:21:43,151 INFO L413 NwaCegarLoop]: 2569 mSDtfsCounter, 3895 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 2869 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3902 SdHoareTripleChecker+Valid, 4704 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:21:43,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3902 Valid, 4704 Invalid, 2912 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 2869 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-11-19 08:21:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6680 states. [2022-11-19 08:21:43,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6680 to 3450. [2022-11-19 08:21:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 2588 states have (on average 1.8431221020092736) internal successors, (4770), 3425 states have internal predecessors, (4770), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:21:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4820 transitions. [2022-11-19 08:21:43,213 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4820 transitions. Word has length 36 [2022-11-19 08:21:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:43,213 INFO L495 AbstractCegarLoop]: Abstraction has 3450 states and 4820 transitions. [2022-11-19 08:21:43,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4820 transitions. [2022-11-19 08:21:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 08:21:43,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:43,214 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] [2022-11-19 08:21:43,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:43,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:43,427 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:21:43,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:43,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2022-11-19 08:21:43,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:21:43,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109387252] [2022-11-19 08:21:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:43,428 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-19 08:21:43,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:21:43,430 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:43,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:43,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:21:43,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:43,724 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-19 08:21:43,929 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-19 08:21:43,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:21:43,930 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:21:43,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109387252] [2022-11-19 08:21:43,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109387252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:21:43,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:21:43,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:21:43,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290682841] [2022-11-19 08:21:43,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:21:43,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:21:43,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:21:43,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:21:43,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:21:43,931 INFO L87 Difference]: Start difference. First operand 3450 states and 4820 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:54,591 INFO L93 Difference]: Finished difference Result 6365 states and 8577 transitions. [2022-11-19 08:21:54,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:21:54,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-19 08:21:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:54,598 INFO L225 Difference]: With dead ends: 6365 [2022-11-19 08:21:54,598 INFO L226 Difference]: Without dead ends: 6365 [2022-11-19 08:21:54,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:21:54,599 INFO L413 NwaCegarLoop]: 2782 mSDtfsCounter, 2855 mSDsluCounter, 2606 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2859 SdHoareTripleChecker+Valid, 5388 SdHoareTripleChecker+Invalid, 3047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:21:54,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2859 Valid, 5388 Invalid, 3047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3035 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2022-11-19 08:21:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6365 states. [2022-11-19 08:21:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6365 to 3446. [2022-11-19 08:21:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3446 states, 2588 states have (on average 1.8400309119010818) internal successors, (4762), 3421 states have internal predecessors, (4762), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:21:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 4812 transitions. [2022-11-19 08:21:54,684 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 4812 transitions. Word has length 36 [2022-11-19 08:21:54,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:54,685 INFO L495 AbstractCegarLoop]: Abstraction has 3446 states and 4812 transitions. [2022-11-19 08:21:54,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:21:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 4812 transitions. [2022-11-19 08:21:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 08:21:54,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:54,687 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] [2022-11-19 08:21:54,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:54,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:54,899 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:21:54,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:54,900 INFO L85 PathProgramCache]: Analyzing trace with hash -775407193, now seen corresponding path program 1 times [2022-11-19 08:21:54,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:21:54,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102002289] [2022-11-19 08:21:54,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:54,901 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-19 08:21:54,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:21:54,902 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:21:54,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (17)] Waiting until timeout for monitored process [2022-11-19 08:21:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:55,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:21:55,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:55,204 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-19 08:21:55,293 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-19 08:21:55,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:21:55,294 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:21:55,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102002289] [2022-11-19 08:21:55,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102002289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:21:55,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:21:55,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:21:55,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43519773] [2022-11-19 08:21:55,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:21:55,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:21:55,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:21:55,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:21:55,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:21:55,295 INFO L87 Difference]: Start difference. First operand 3446 states and 4812 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:03,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:03,094 INFO L93 Difference]: Finished difference Result 7123 states and 9691 transitions. [2022-11-19 08:22:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:22:03,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-19 08:22:03,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:03,103 INFO L225 Difference]: With dead ends: 7123 [2022-11-19 08:22:03,103 INFO L226 Difference]: Without dead ends: 7123 [2022-11-19 08:22:03,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:22:03,104 INFO L413 NwaCegarLoop]: 2265 mSDtfsCounter, 4675 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 2965 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4685 SdHoareTripleChecker+Valid, 4587 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:03,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4685 Valid, 4587 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2965 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-11-19 08:22:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7123 states. [2022-11-19 08:22:03,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7123 to 3443. [2022-11-19 08:22:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3443 states, 2588 states have (on average 1.8315301391035548) internal successors, (4740), 3418 states have internal predecessors, (4740), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:22:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 4790 transitions. [2022-11-19 08:22:03,166 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 4790 transitions. Word has length 36 [2022-11-19 08:22:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:03,166 INFO L495 AbstractCegarLoop]: Abstraction has 3443 states and 4790 transitions. [2022-11-19 08:22:03,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:03,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 4790 transitions. [2022-11-19 08:22:03,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 08:22:03,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:03,167 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] [2022-11-19 08:22:03,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (17)] Forceful destruction successful, exit code 0 [2022-11-19 08:22:03,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:03,380 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:22:03,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:03,380 INFO L85 PathProgramCache]: Analyzing trace with hash -775407192, now seen corresponding path program 1 times [2022-11-19 08:22:03,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:22:03,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731807977] [2022-11-19 08:22:03,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:03,381 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-19 08:22:03,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:22:03,382 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:03,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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)] Waiting until timeout for monitored process [2022-11-19 08:22:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:03,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:22:03,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:03,685 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-19 08:22:03,911 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-19 08:22:03,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:22:03,911 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:22:03,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731807977] [2022-11-19 08:22:03,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731807977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:22:03,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:22:03,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:22:03,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107837100] [2022-11-19 08:22:03,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:22:03,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:22:03,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:22:03,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:22:03,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:22:03,913 INFO L87 Difference]: Start difference. First operand 3443 states and 4790 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:12,774 INFO L93 Difference]: Finished difference Result 5201 states and 6963 transitions. [2022-11-19 08:22:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:22:12,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-19 08:22:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:12,779 INFO L225 Difference]: With dead ends: 5201 [2022-11-19 08:22:12,779 INFO L226 Difference]: Without dead ends: 5201 [2022-11-19 08:22:12,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:22:12,781 INFO L413 NwaCegarLoop]: 2555 mSDtfsCounter, 2416 mSDsluCounter, 2179 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 4734 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:12,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2416 Valid, 4734 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2623 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-11-19 08:22:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2022-11-19 08:22:12,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 3443. [2022-11-19 08:22:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3443 states, 2588 states have (on average 1.8284389489953632) internal successors, (4732), 3418 states have internal predecessors, (4732), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:22:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 4782 transitions. [2022-11-19 08:22:12,851 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 4782 transitions. Word has length 36 [2022-11-19 08:22:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:12,851 INFO L495 AbstractCegarLoop]: Abstraction has 3443 states and 4782 transitions. [2022-11-19 08:22:12,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 4782 transitions. [2022-11-19 08:22:12,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 08:22:12,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:12,853 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] [2022-11-19 08:22:12,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:22:13,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:13,066 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:22:13,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:13,066 INFO L85 PathProgramCache]: Analyzing trace with hash -715750141, now seen corresponding path program 1 times [2022-11-19 08:22:13,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:22:13,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950546615] [2022-11-19 08:22:13,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:13,067 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-19 08:22:13,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:22:13,068 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:13,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:13,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:22:13,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:13,360 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-19 08:22:13,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:22:13,360 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:22:13,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950546615] [2022-11-19 08:22:13,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950546615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:22:13,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:22:13,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:22:13,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005213752] [2022-11-19 08:22:13,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:22:13,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:22:13,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:22:13,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:22:13,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:22:13,362 INFO L87 Difference]: Start difference. First operand 3443 states and 4782 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:13,446 INFO L93 Difference]: Finished difference Result 3431 states and 4758 transitions. [2022-11-19 08:22:13,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:22:13,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-19 08:22:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:13,451 INFO L225 Difference]: With dead ends: 3431 [2022-11-19 08:22:13,452 INFO L226 Difference]: Without dead ends: 3431 [2022-11-19 08:22:13,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:22:13,452 INFO L413 NwaCegarLoop]: 2003 mSDtfsCounter, 969 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 5030 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.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:13,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 5030 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:22:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2022-11-19 08:22:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3431. [2022-11-19 08:22:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3431 states, 2576 states have (on average 1.8276397515527951) internal successors, (4708), 3406 states have internal predecessors, (4708), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:22:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 4758 transitions. [2022-11-19 08:22:13,497 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 4758 transitions. Word has length 40 [2022-11-19 08:22:13,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:13,498 INFO L495 AbstractCegarLoop]: Abstraction has 3431 states and 4758 transitions. [2022-11-19 08:22:13,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 4758 transitions. [2022-11-19 08:22:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-19 08:22:13,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:13,499 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] [2022-11-19 08:22:13,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:13,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:13,711 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:22:13,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:13,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1005839671, now seen corresponding path program 1 times [2022-11-19 08:22:13,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:22:13,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034327685] [2022-11-19 08:22:13,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:13,712 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-19 08:22:13,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:22:13,713 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:13,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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)] Waiting until timeout for monitored process [2022-11-19 08:22:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:13,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:22:13,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:14,253 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-19 08:22:14,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:22:14,254 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:22:14,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034327685] [2022-11-19 08:22:14,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034327685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:22:14,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:22:14,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:22:14,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166215973] [2022-11-19 08:22:14,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:22:14,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:22:14,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:22:14,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:22:14,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:22:14,255 INFO L87 Difference]: Start difference. First operand 3431 states and 4758 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:14,640 INFO L93 Difference]: Finished difference Result 5072 states and 6779 transitions. [2022-11-19 08:22:14,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:22:14,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-19 08:22:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:14,647 INFO L225 Difference]: With dead ends: 5072 [2022-11-19 08:22:14,647 INFO L226 Difference]: Without dead ends: 5072 [2022-11-19 08:22:14,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:22:14,648 INFO L413 NwaCegarLoop]: 2092 mSDtfsCounter, 1380 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 3942 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:14,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 3942 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:22:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2022-11-19 08:22:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 4447. [2022-11-19 08:22:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4447 states, 3585 states have (on average 1.814504881450488) internal successors, (6505), 4412 states have internal predecessors, (6505), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-19 08:22:14,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4447 states to 4447 states and 6575 transitions. [2022-11-19 08:22:14,715 INFO L78 Accepts]: Start accepts. Automaton has 4447 states and 6575 transitions. Word has length 48 [2022-11-19 08:22:14,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:14,715 INFO L495 AbstractCegarLoop]: Abstraction has 4447 states and 6575 transitions. [2022-11-19 08:22:14,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4447 states and 6575 transitions. [2022-11-19 08:22:14,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-19 08:22:14,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:14,717 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] [2022-11-19 08:22:14,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:22:14,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:14,929 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:22:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:14,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1815084135, now seen corresponding path program 1 times [2022-11-19 08:22:14,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:22:14,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963611541] [2022-11-19 08:22:14,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:14,931 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-19 08:22:14,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:22:14,932 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:14,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (21)] Waiting until timeout for monitored process [2022-11-19 08:22:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:15,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:22:15,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:15,271 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-19 08:22:15,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:22:15,271 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:22:15,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963611541] [2022-11-19 08:22:15,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963611541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:22:15,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:22:15,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:22:15,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668075639] [2022-11-19 08:22:15,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:22:15,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:22:15,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:22:15,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:22:15,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:22:15,273 INFO L87 Difference]: Start difference. First operand 4447 states and 6575 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:15,368 INFO L93 Difference]: Finished difference Result 5580 states and 7761 transitions. [2022-11-19 08:22:15,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:22:15,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-19 08:22:15,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:15,374 INFO L225 Difference]: With dead ends: 5580 [2022-11-19 08:22:15,374 INFO L226 Difference]: Without dead ends: 5580 [2022-11-19 08:22:15,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:22:15,376 INFO L413 NwaCegarLoop]: 3056 mSDtfsCounter, 1964 mSDsluCounter, 4351 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1974 SdHoareTripleChecker+Valid, 7407 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.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:15,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1974 Valid, 7407 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:22:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5580 states. [2022-11-19 08:22:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5580 to 4405. [2022-11-19 08:22:15,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4405 states, 3543 states have (on average 1.8162574089754446) internal successors, (6435), 4370 states have internal predecessors, (6435), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-19 08:22:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4405 states to 4405 states and 6505 transitions. [2022-11-19 08:22:15,440 INFO L78 Accepts]: Start accepts. Automaton has 4405 states and 6505 transitions. Word has length 51 [2022-11-19 08:22:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:15,440 INFO L495 AbstractCegarLoop]: Abstraction has 4405 states and 6505 transitions. [2022-11-19 08:22:15,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:15,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4405 states and 6505 transitions. [2022-11-19 08:22:15,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-19 08:22:15,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:15,442 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] [2022-11-19 08:22:15,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (21)] Forceful destruction successful, exit code 0 [2022-11-19 08:22:15,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:15,655 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:22:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:15,656 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2022-11-19 08:22:15,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:22:15,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391566245] [2022-11-19 08:22:15,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:15,657 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-19 08:22:15,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:22:15,659 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:15,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:16,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:22:16,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:16,085 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-19 08:22:16,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:22:16,085 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:22:16,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391566245] [2022-11-19 08:22:16,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391566245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:22:16,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:22:16,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:22:16,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596790382] [2022-11-19 08:22:16,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:22:16,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:22:16,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:22:16,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:22:16,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:22:16,088 INFO L87 Difference]: Start difference. First operand 4405 states and 6505 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:16,191 INFO L93 Difference]: Finished difference Result 5317 states and 7249 transitions. [2022-11-19 08:22:16,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:22:16,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-11-19 08:22:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:16,199 INFO L225 Difference]: With dead ends: 5317 [2022-11-19 08:22:16,199 INFO L226 Difference]: Without dead ends: 5317 [2022-11-19 08:22:16,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:22:16,202 INFO L413 NwaCegarLoop]: 3316 mSDtfsCounter, 1955 mSDsluCounter, 4660 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1965 SdHoareTripleChecker+Valid, 7976 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.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:16,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1965 Valid, 7976 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:22:16,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2022-11-19 08:22:16,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 4387. [2022-11-19 08:22:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4387 states, 3525 states have (on average 1.8170212765957447) internal successors, (6405), 4352 states have internal predecessors, (6405), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-19 08:22:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4387 states to 4387 states and 6475 transitions. [2022-11-19 08:22:16,295 INFO L78 Accepts]: Start accepts. Automaton has 4387 states and 6475 transitions. Word has length 54 [2022-11-19 08:22:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:16,295 INFO L495 AbstractCegarLoop]: Abstraction has 4387 states and 6475 transitions. [2022-11-19 08:22:16,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:16,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4387 states and 6475 transitions. [2022-11-19 08:22:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-19 08:22:16,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:16,296 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] [2022-11-19 08:22:16,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:16,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:16,510 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:22:16,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1318370118, now seen corresponding path program 1 times [2022-11-19 08:22:16,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:22:16,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835071728] [2022-11-19 08:22:16,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:16,512 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-19 08:22:16,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:22:16,513 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:16,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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)] Waiting until timeout for monitored process [2022-11-19 08:22:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:16,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:22:16,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:16,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:22:16,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:22:16,897 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 29 treesize of output 38 [2022-11-19 08:22:16,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:22:16,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2022-11-19 08:22:16,990 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-19 08:22:16,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:22:16,991 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:22:16,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835071728] [2022-11-19 08:22:16,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835071728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:22:16,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:22:16,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:22:16,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134128861] [2022-11-19 08:22:16,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:22:16,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:22:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:22:16,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:22:16,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:22:16,993 INFO L87 Difference]: Start difference. First operand 4387 states and 6475 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:19,227 INFO L93 Difference]: Finished difference Result 4491 states and 6585 transitions. [2022-11-19 08:22:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:22:19,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-11-19 08:22:19,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:19,234 INFO L225 Difference]: With dead ends: 4491 [2022-11-19 08:22:19,234 INFO L226 Difference]: Without dead ends: 4491 [2022-11-19 08:22:19,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:22:19,235 INFO L413 NwaCegarLoop]: 1891 mSDtfsCounter, 907 mSDsluCounter, 2954 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 4845 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:19,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 4845 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 122 Unchecked, 2.2s Time] [2022-11-19 08:22:19,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-11-19 08:22:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4353. [2022-11-19 08:22:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4353 states, 3491 states have (on average 1.8246920653107992) internal successors, (6370), 4318 states have internal predecessors, (6370), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-19 08:22:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4353 states to 4353 states and 6440 transitions. [2022-11-19 08:22:19,290 INFO L78 Accepts]: Start accepts. Automaton has 4353 states and 6440 transitions. Word has length 57 [2022-11-19 08:22:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:19,290 INFO L495 AbstractCegarLoop]: Abstraction has 4353 states and 6440 transitions. [2022-11-19 08:22:19,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4353 states and 6440 transitions. [2022-11-19 08:22:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-19 08:22:19,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:19,291 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] [2022-11-19 08:22:19,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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)] Ended with exit code 0 [2022-11-19 08:22:19,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:19,505 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:22:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:19,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2076762779, now seen corresponding path program 1 times [2022-11-19 08:22:19,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:22:19,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131719018] [2022-11-19 08:22:19,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:19,506 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-19 08:22:19,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:22:19,507 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:19,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (24)] Waiting until timeout for monitored process [2022-11-19 08:22:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:19,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:22:19,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:20,177 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-19 08:22:20,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:22:20,177 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:22:20,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131719018] [2022-11-19 08:22:20,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131719018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:22:20,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:22:20,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:22:20,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828842410] [2022-11-19 08:22:20,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:22:20,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:22:20,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:22:20,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:22:20,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:22:20,179 INFO L87 Difference]: Start difference. First operand 4353 states and 6440 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:20,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:20,433 INFO L93 Difference]: Finished difference Result 5976 states and 8528 transitions. [2022-11-19 08:22:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:22:20,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-19 08:22:20,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:20,441 INFO L225 Difference]: With dead ends: 5976 [2022-11-19 08:22:20,442 INFO L226 Difference]: Without dead ends: 5976 [2022-11-19 08:22:20,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:22:20,443 INFO L413 NwaCegarLoop]: 2431 mSDtfsCounter, 1077 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 4309 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:20,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 4309 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:22:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2022-11-19 08:22:20,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 5425. [2022-11-19 08:22:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5425 states, 4555 states have (on average 1.8010976948408342) internal successors, (8204), 5379 states have internal predecessors, (8204), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-19 08:22:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 8296 transitions. [2022-11-19 08:22:20,511 INFO L78 Accepts]: Start accepts. Automaton has 5425 states and 8296 transitions. Word has length 59 [2022-11-19 08:22:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:20,512 INFO L495 AbstractCegarLoop]: Abstraction has 5425 states and 8296 transitions. [2022-11-19 08:22:20,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 5425 states and 8296 transitions. [2022-11-19 08:22:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-19 08:22:20,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:20,513 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] [2022-11-19 08:22:20,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (24)] Forceful destruction successful, exit code 0 [2022-11-19 08:22:20,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:20,736 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:22:20,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2022-11-19 08:22:20,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:22:20,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292002728] [2022-11-19 08:22:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:20,737 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-19 08:22:20,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:22:20,738 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:20,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:21,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 08:22:21,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:21,214 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-19 08:22:21,221 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-19 08:22:21,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:21,764 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-19 08:22:21,786 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:22:21,787 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-19 08:22:21,801 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-19 08:22:21,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:22:21,802 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:22:21,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292002728] [2022-11-19 08:22:21,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292002728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:22:21,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:22:21,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:22:21,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683710077] [2022-11-19 08:22:21,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:22:21,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:22:21,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:22:21,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:22:21,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:22:21,804 INFO L87 Difference]: Start difference. First operand 5425 states and 8296 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:28,303 INFO L93 Difference]: Finished difference Result 7844 states and 12019 transitions. [2022-11-19 08:22:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:22:28,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-19 08:22:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:28,314 INFO L225 Difference]: With dead ends: 7844 [2022-11-19 08:22:28,314 INFO L226 Difference]: Without dead ends: 7844 [2022-11-19 08:22:28,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:22:28,315 INFO L413 NwaCegarLoop]: 849 mSDtfsCounter, 2474 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 1842 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2488 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:28,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2488 Valid, 1438 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1842 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-11-19 08:22:28,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2022-11-19 08:22:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 5185. [2022-11-19 08:22:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5185 states, 4399 states have (on average 1.7328938395089792) internal successors, (7623), 5139 states have internal predecessors, (7623), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-19 08:22:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 7715 transitions. [2022-11-19 08:22:28,390 INFO L78 Accepts]: Start accepts. Automaton has 5185 states and 7715 transitions. Word has length 62 [2022-11-19 08:22:28,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:28,390 INFO L495 AbstractCegarLoop]: Abstraction has 5185 states and 7715 transitions. [2022-11-19 08:22:28,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 5185 states and 7715 transitions. [2022-11-19 08:22:28,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 08:22:28,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:28,391 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-19 08:22:28,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:28,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:28,594 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:22:28,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2022-11-19 08:22:28,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:22:28,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888242403] [2022-11-19 08:22:28,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:28,595 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-19 08:22:28,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:22:28,596 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:28,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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)] Waiting until timeout for monitored process [2022-11-19 08:22:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:28,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:22:29,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:29,007 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-19 08:22:29,021 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-19 08:22:29,069 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-19 08:22:29,081 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-19 08:22:29,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:22:29,082 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:22:29,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888242403] [2022-11-19 08:22:29,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888242403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:22:29,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:22:29,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:22:29,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552264225] [2022-11-19 08:22:29,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:22:29,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:22:29,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:22:29,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:22:29,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:22:29,085 INFO L87 Difference]: Start difference. First operand 5185 states and 7715 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:34,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:34,690 INFO L93 Difference]: Finished difference Result 5184 states and 7712 transitions. [2022-11-19 08:22:34,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:22:34,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-11-19 08:22:34,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:34,696 INFO L225 Difference]: With dead ends: 5184 [2022-11-19 08:22:34,696 INFO L226 Difference]: Without dead ends: 5184 [2022-11-19 08:22:34,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:22:34,697 INFO L413 NwaCegarLoop]: 1922 mSDtfsCounter, 4 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5098 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:34,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5098 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-11-19 08:22:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5184 states. [2022-11-19 08:22:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5184 to 5184. [2022-11-19 08:22:34,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5184 states, 4399 states have (on average 1.7322118663332575) internal successors, (7620), 5138 states have internal predecessors, (7620), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-19 08:22:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 7712 transitions. [2022-11-19 08:22:34,760 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 7712 transitions. Word has length 67 [2022-11-19 08:22:34,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:34,760 INFO L495 AbstractCegarLoop]: Abstraction has 5184 states and 7712 transitions. [2022-11-19 08:22:34,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:34,760 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 7712 transitions. [2022-11-19 08:22:34,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 08:22:34,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:34,762 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-19 08:22:34,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:22:34,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:34,976 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:22:34,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:34,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2022-11-19 08:22:34,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:22:34,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338965457] [2022-11-19 08:22:34,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:34,977 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-19 08:22:34,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:22:34,978 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:34,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (27)] Waiting until timeout for monitored process [2022-11-19 08:22:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:35,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 08:22:35,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:35,352 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-19 08:22:35,372 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-19 08:22:35,384 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-19 08:22:35,437 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-19 08:22:35,444 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-19 08:22:35,463 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-19 08:22:35,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:22:35,463 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:22:35,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338965457] [2022-11-19 08:22:35,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338965457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:22:35,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:22:35,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:22:35,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319286080] [2022-11-19 08:22:35,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:22:35,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:22:35,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:22:35,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:22:35,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:22:35,465 INFO L87 Difference]: Start difference. First operand 5184 states and 7712 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:43,155 INFO L93 Difference]: Finished difference Result 5183 states and 7709 transitions. [2022-11-19 08:22:43,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:22:43,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-11-19 08:22:43,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:43,161 INFO L225 Difference]: With dead ends: 5183 [2022-11-19 08:22:43,161 INFO L226 Difference]: Without dead ends: 5183 [2022-11-19 08:22:43,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:22:43,161 INFO L413 NwaCegarLoop]: 1922 mSDtfsCounter, 2 mSDsluCounter, 3165 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5087 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:43,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5087 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-11-19 08:22:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2022-11-19 08:22:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 5183. [2022-11-19 08:22:43,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5183 states, 4396 states have (on average 1.7327115559599635) internal successors, (7617), 5137 states have internal predecessors, (7617), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-19 08:22:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 7709 transitions. [2022-11-19 08:22:43,215 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 7709 transitions. Word has length 67 [2022-11-19 08:22:43,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:43,215 INFO L495 AbstractCegarLoop]: Abstraction has 5183 states and 7709 transitions. [2022-11-19 08:22:43,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 7709 transitions. [2022-11-19 08:22:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 08:22:43,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:43,217 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-19 08:22:43,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (27)] Forceful destruction successful, exit code 0 [2022-11-19 08:22:43,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:43,431 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:22:43,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:43,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017746, now seen corresponding path program 1 times [2022-11-19 08:22:43,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:22:43,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567170587] [2022-11-19 08:22:43,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:43,432 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-19 08:22:43,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:22:43,433 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:43,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:43,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:22:43,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:43,866 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-19 08:22:43,876 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-19 08:22:43,907 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-19 08:22:43,917 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-19 08:22:43,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:22:43,917 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:22:43,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567170587] [2022-11-19 08:22:43,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567170587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:22:43,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:22:43,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:22:43,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28319176] [2022-11-19 08:22:43,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:22:43,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:22:43,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:22:43,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:22:43,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:22:43,919 INFO L87 Difference]: Start difference. First operand 5183 states and 7709 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:49,341 INFO L93 Difference]: Finished difference Result 5182 states and 7705 transitions. [2022-11-19 08:22:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:22:49,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-11-19 08:22:49,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:49,345 INFO L225 Difference]: With dead ends: 5182 [2022-11-19 08:22:49,345 INFO L226 Difference]: Without dead ends: 5182 [2022-11-19 08:22:49,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:22:49,346 INFO L413 NwaCegarLoop]: 1920 mSDtfsCounter, 4 mSDsluCounter, 3173 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5093 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:49,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5093 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-11-19 08:22:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5182 states. [2022-11-19 08:22:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5182 to 5182. [2022-11-19 08:22:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5182 states, 4396 states have (on average 1.7318016378525933) internal successors, (7613), 5136 states have internal predecessors, (7613), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-19 08:22:49,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5182 states to 5182 states and 7705 transitions. [2022-11-19 08:22:49,403 INFO L78 Accepts]: Start accepts. Automaton has 5182 states and 7705 transitions. Word has length 67 [2022-11-19 08:22:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:49,404 INFO L495 AbstractCegarLoop]: Abstraction has 5182 states and 7705 transitions. [2022-11-19 08:22:49,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 5182 states and 7705 transitions. [2022-11-19 08:22:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 08:22:49,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:49,405 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-19 08:22:49,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:49,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:49,620 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:22:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:49,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017745, now seen corresponding path program 1 times [2022-11-19 08:22:49,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:22:49,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460033265] [2022-11-19 08:22:49,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:49,621 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-19 08:22:49,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:22:49,623 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:49,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (29)] Waiting until timeout for monitored process [2022-11-19 08:22:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:49,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 08:22:49,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:49,997 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-19 08:22:50,016 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-19 08:22:50,026 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-19 08:22:50,133 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-19 08:22:50,138 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-19 08:22:50,153 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-19 08:22:50,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:22:50,154 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:22:50,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460033265] [2022-11-19 08:22:50,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460033265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:22:50,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:22:50,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:22:50,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975310527] [2022-11-19 08:22:50,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:22:50,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:22:50,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:22:50,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:22:50,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:22:50,156 INFO L87 Difference]: Start difference. First operand 5182 states and 7705 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:57,547 INFO L93 Difference]: Finished difference Result 5181 states and 7701 transitions. [2022-11-19 08:22:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:22:57,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-11-19 08:22:57,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:57,552 INFO L225 Difference]: With dead ends: 5181 [2022-11-19 08:22:57,552 INFO L226 Difference]: Without dead ends: 5181 [2022-11-19 08:22:57,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:22:57,553 INFO L413 NwaCegarLoop]: 1920 mSDtfsCounter, 2 mSDsluCounter, 3162 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5082 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:57,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5082 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-11-19 08:22:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5181 states. [2022-11-19 08:22:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5181 to 5181. [2022-11-19 08:22:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 4392 states have (on average 1.7324681238615665) internal successors, (7609), 5135 states have internal predecessors, (7609), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-19 08:22:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 7701 transitions. [2022-11-19 08:22:57,615 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 7701 transitions. Word has length 67 [2022-11-19 08:22:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:57,615 INFO L495 AbstractCegarLoop]: Abstraction has 5181 states and 7701 transitions. [2022-11-19 08:22:57,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 7701 transitions. [2022-11-19 08:22:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-19 08:22:57,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:57,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:22:57,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (29)] Forceful destruction successful, exit code 0 [2022-11-19 08:22:57,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:57,822 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:22:57,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:57,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1662288335, now seen corresponding path program 1 times [2022-11-19 08:22:57,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:22:57,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097906145] [2022-11-19 08:22:57,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:57,824 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-19 08:22:57,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:22:57,825 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:57,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (30)] Waiting until timeout for monitored process [2022-11-19 08:22:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:58,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:22:58,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:58,232 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-19 08:22:58,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:22:58,232 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:22:58,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097906145] [2022-11-19 08:22:58,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097906145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:22:58,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:22:58,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:22:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711890491] [2022-11-19 08:22:58,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:22:58,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:22:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:22:58,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:22:58,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:22:58,235 INFO L87 Difference]: Start difference. First operand 5181 states and 7701 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 08:22:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:58,327 INFO L93 Difference]: Finished difference Result 5184 states and 7710 transitions. [2022-11-19 08:22:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:22:58,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-11-19 08:22:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:58,340 INFO L225 Difference]: With dead ends: 5184 [2022-11-19 08:22:58,340 INFO L226 Difference]: Without dead ends: 5184 [2022-11-19 08:22:58,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:22:58,341 INFO L413 NwaCegarLoop]: 1919 mSDtfsCounter, 2 mSDsluCounter, 3830 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5749 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.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:58,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5749 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:22:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5184 states. [2022-11-19 08:22:58,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5184 to 5184. [2022-11-19 08:22:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5184 states, 4394 states have (on average 1.732362312243969) internal successors, (7612), 5138 states have internal predecessors, (7612), 46 states have call successors, (46), 3 states have call predecessors, (46), 4 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-19 08:22:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 7710 transitions. [2022-11-19 08:22:58,427 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 7710 transitions. Word has length 75 [2022-11-19 08:22:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:58,427 INFO L495 AbstractCegarLoop]: Abstraction has 5184 states and 7710 transitions. [2022-11-19 08:22:58,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 08:22:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 7710 transitions. [2022-11-19 08:22:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-19 08:22:58,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:58,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:22:58,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (30)] Forceful destruction successful, exit code 0 [2022-11-19 08:22:58,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:58,642 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:22:58,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash -862868416, now seen corresponding path program 1 times [2022-11-19 08:22:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:22:58,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695387020] [2022-11-19 08:22:58,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:58,644 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-19 08:22:58,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:22:58,644 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:58,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:22:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:59,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:22:59,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:59,071 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-19 08:22:59,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:22:59,170 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-19 08:22:59,170 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:22:59,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695387020] [2022-11-19 08:22:59,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695387020] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:22:59,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [154402748] [2022-11-19 08:22:59,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:59,171 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:22:59,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:22:59,174 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:22:59,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-19 08:22:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:59,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:22:59,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:59,911 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-19 08:22:59,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:22:59,959 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-19 08:22:59,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [154402748] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:22:59,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965969952] [2022-11-19 08:22:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:59,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:22:59,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:22:59,966 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:22:59,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-19 08:23:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:23:00,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:23:00,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:23:00,395 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-19 08:23:00,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:23:00,438 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-19 08:23:00,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965969952] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:23:00,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:23:00,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-19 08:23:00,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564820380] [2022-11-19 08:23:00,440 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:23:00,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:23:00,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:23:00,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:23:00,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:23:00,441 INFO L87 Difference]: Start difference. First operand 5184 states and 7710 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 08:23:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:23:00,703 INFO L93 Difference]: Finished difference Result 5196 states and 7732 transitions. [2022-11-19 08:23:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:23:00,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-11-19 08:23:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:23:00,716 INFO L225 Difference]: With dead ends: 5196 [2022-11-19 08:23:00,716 INFO L226 Difference]: Without dead ends: 5196 [2022-11-19 08:23:00,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 444 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-19 08:23:00,717 INFO L413 NwaCegarLoop]: 1919 mSDtfsCounter, 17 mSDsluCounter, 5742 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7661 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:23:00,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 7661 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:23:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5196 states. [2022-11-19 08:23:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5196 to 5194. [2022-11-19 08:23:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5194 states, 4403 states have (on average 1.7322280263456733) internal successors, (7627), 5147 states have internal predecessors, (7627), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-19 08:23:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 7725 transitions. [2022-11-19 08:23:00,806 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 7725 transitions. Word has length 76 [2022-11-19 08:23:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:23:00,806 INFO L495 AbstractCegarLoop]: Abstraction has 5194 states and 7725 transitions. [2022-11-19 08:23:00,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 08:23:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 7725 transitions. [2022-11-19 08:23:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-19 08:23:00,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:23:00,808 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:23:00,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-19 08:23:01,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-19 08:23:01,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:23:01,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:23:01,414 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:23:01,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:23:01,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1849955855, now seen corresponding path program 2 times [2022-11-19 08:23:01,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:23:01,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032128165] [2022-11-19 08:23:01,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:23:01,416 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-19 08:23:01,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:23:01,417 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:23:01,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:23:01,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:23:01,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:23:02,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:23:02,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:23:02,066 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-19 08:23:02,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:23:02,282 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-19 08:23:02,282 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:23:02,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032128165] [2022-11-19 08:23:02,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032128165] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:23:02,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1308654214] [2022-11-19 08:23:02,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:23:02,283 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:23:02,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:23:02,286 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:23:02,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-19 08:23:04,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:23:04,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:23:04,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:23:04,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:23:04,058 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-19 08:23:04,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:23:04,143 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-19 08:23:04,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1308654214] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:23:04,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41861568] [2022-11-19 08:23:04,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:23:04,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:23:04,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:23:04,144 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:23:04,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-19 08:23:17,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:23:17,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:23:17,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-19 08:23:17,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:23:17,586 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:23:17,586 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-19 08:23:17,622 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-19 08:23:18,077 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:23:18,077 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-19 08:23:18,160 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-19 08:23:18,199 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-19 08:23:18,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:23:18,333 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-19 08:23:18,333 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-19 08:23:18,356 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_2339) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem39#1.base|)) is different from false [2022-11-19 08:23:18,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41861568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:23:18,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-19 08:23:18,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-19 08:23:18,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139557719] [2022-11-19 08:23:18,359 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-19 08:23:18,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-19 08:23:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:23:18,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-19 08:23:18,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-11-19 08:23:18,361 INFO L87 Difference]: Start difference. First operand 5194 states and 7725 transitions. Second operand has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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-19 08:23:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:23:55,906 INFO L93 Difference]: Finished difference Result 13909 states and 21458 transitions. [2022-11-19 08:23:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-19 08:23:55,907 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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 79 [2022-11-19 08:23:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:23:55,937 INFO L225 Difference]: With dead ends: 13909 [2022-11-19 08:23:55,937 INFO L226 Difference]: Without dead ends: 13909 [2022-11-19 08:23:55,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 368 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=318, Invalid=1916, Unknown=26, NotChecked=92, Total=2352 [2022-11-19 08:23:55,938 INFO L413 NwaCegarLoop]: 1991 mSDtfsCounter, 4072 mSDsluCounter, 28941 mSDsCounter, 0 mSdLazyCounter, 21696 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4086 SdHoareTripleChecker+Valid, 30932 SdHoareTripleChecker+Invalid, 23641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 21696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1888 IncrementalHoareTripleChecker+Unchecked, 35.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:23:55,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4086 Valid, 30932 Invalid, 23641 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [57 Valid, 21696 Invalid, 0 Unknown, 1888 Unchecked, 35.9s Time] [2022-11-19 08:23:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13909 states. [2022-11-19 08:23:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13909 to 5200. [2022-11-19 08:23:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 4409 states have (on average 1.7316851893853482) internal successors, (7635), 5153 states have internal predecessors, (7635), 46 states have call successors, (46), 4 states have call predecessors, (46), 6 states have return successors, (56), 43 states have call predecessors, (56), 46 states have call successors, (56) [2022-11-19 08:23:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 7737 transitions. [2022-11-19 08:23:56,050 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 7737 transitions. Word has length 79 [2022-11-19 08:23:56,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:23:56,050 INFO L495 AbstractCegarLoop]: Abstraction has 5200 states and 7737 transitions. [2022-11-19 08:23:56,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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-19 08:23:56,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 7737 transitions. [2022-11-19 08:23:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-19 08:23:56,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:23:56,051 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:23:56,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-11-19 08:23:56,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-19 08:23:56,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:23:56,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:23:56,660 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:23:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:23:56,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1990769269, now seen corresponding path program 1 times [2022-11-19 08:23:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:23:56,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610449303] [2022-11-19 08:23:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:23:56,662 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-19 08:23:56,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:23:56,663 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:23:56,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:23:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:23:57,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:23:57,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:23:57,171 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-19 08:23:57,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:23:57,439 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-19 08:23:57,439 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:23:57,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610449303] [2022-11-19 08:23:57,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610449303] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:23:57,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [708306154] [2022-11-19 08:23:57,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:23:57,440 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:23:57,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:23:57,441 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:23:57,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-19 08:23:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:23:58,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:23:58,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:23:58,309 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-19 08:23:58,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:23:58,387 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-19 08:23:58,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [708306154] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:23:58,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488957378] [2022-11-19 08:23:58,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:23:58,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:23:58,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:23:58,391 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:23:58,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-19 08:23:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:23:58,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 08:23:58,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:23:58,929 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-19 08:23:58,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:23:59,256 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-19 08:23:59,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488957378] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:23:59,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:23:59,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 20 [2022-11-19 08:23:59,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090347899] [2022-11-19 08:23:59,257 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:23:59,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-19 08:23:59,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:23:59,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-19 08:23:59,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2022-11-19 08:23:59,258 INFO L87 Difference]: Start difference. First operand 5200 states and 7737 transitions. Second operand has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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-19 08:24:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:24:00,482 INFO L93 Difference]: Finished difference Result 5216 states and 7765 transitions. [2022-11-19 08:24:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-19 08:24:00,483 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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 79 [2022-11-19 08:24:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:24:00,490 INFO L225 Difference]: With dead ends: 5216 [2022-11-19 08:24:00,490 INFO L226 Difference]: Without dead ends: 5208 [2022-11-19 08:24:00,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=416, Invalid=774, Unknown=0, NotChecked=0, Total=1190 [2022-11-19 08:24:00,493 INFO L413 NwaCegarLoop]: 1919 mSDtfsCounter, 88 mSDsluCounter, 11488 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 13407 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:24:00,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 13407 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-19 08:24:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5208 states. [2022-11-19 08:24:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5208 to 5202. [2022-11-19 08:24:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5202 states, 4412 states have (on average 1.7305077062556664) internal successors, (7635), 5155 states have internal predecessors, (7635), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-19 08:24:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 5202 states and 7733 transitions. [2022-11-19 08:24:00,564 INFO L78 Accepts]: Start accepts. Automaton has 5202 states and 7733 transitions. Word has length 79 [2022-11-19 08:24:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:24:00,565 INFO L495 AbstractCegarLoop]: Abstraction has 5202 states and 7733 transitions. [2022-11-19 08:24:00,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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-19 08:24:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 5202 states and 7733 transitions. [2022-11-19 08:24:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-19 08:24:00,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:24:00,566 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:24:00,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-11-19 08:24:00,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:24:00,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-19 08:24:01,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 08:24:01,177 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:24:01,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:24:01,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1877690256, now seen corresponding path program 1 times [2022-11-19 08:24:01,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:24:01,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227036294] [2022-11-19 08:24:01,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:24:01,179 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-19 08:24:01,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:24:01,179 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:24:01,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:24:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:24:01,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-19 08:24:01,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:24:01,942 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-19 08:24:01,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:24:02,589 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-19 08:24:02,589 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:24:02,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227036294] [2022-11-19 08:24:02,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227036294] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:24:02,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [478947567] [2022-11-19 08:24:02,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:24:02,590 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:24:02,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:24:02,591 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:24:02,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-19 08:24:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:24:03,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-19 08:24:03,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:24:03,511 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-19 08:24:03,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:24:03,691 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-19 08:24:03,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [478947567] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:24:03,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002021183] [2022-11-19 08:24:03,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:24:03,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:24:03,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:24:03,694 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:24:03,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-19 08:24:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:24:04,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 08:24:04,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:24:04,283 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-19 08:24:04,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:24:05,377 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-19 08:24:05,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002021183] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:24:05,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:24:05,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-11-19 08:24:05,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077687218] [2022-11-19 08:24:05,378 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:24:05,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-19 08:24:05,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:24:05,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-19 08:24:05,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-11-19 08:24:05,380 INFO L87 Difference]: Start difference. First operand 5202 states and 7733 transitions. Second operand has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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-19 08:24:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:24:09,711 INFO L93 Difference]: Finished difference Result 5242 states and 7828 transitions. [2022-11-19 08:24:09,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-19 08:24:09,712 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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 85 [2022-11-19 08:24:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:24:09,719 INFO L225 Difference]: With dead ends: 5242 [2022-11-19 08:24:09,720 INFO L226 Difference]: Without dead ends: 5236 [2022-11-19 08:24:09,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1590, Invalid=3240, Unknown=0, NotChecked=0, Total=4830 [2022-11-19 08:24:09,722 INFO L413 NwaCegarLoop]: 1924 mSDtfsCounter, 167 mSDsluCounter, 34475 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 36399 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:24:09,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 36399 Invalid, 1240 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [184 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-19 08:24:09,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5236 states. [2022-11-19 08:24:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5236 to 5220. [2022-11-19 08:24:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5220 states, 4430 states have (on average 1.728668171557562) internal successors, (7658), 5173 states have internal predecessors, (7658), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-19 08:24:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 7756 transitions. [2022-11-19 08:24:09,807 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 7756 transitions. Word has length 85 [2022-11-19 08:24:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:24:09,807 INFO L495 AbstractCegarLoop]: Abstraction has 5220 states and 7756 transitions. [2022-11-19 08:24:09,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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-19 08:24:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 7756 transitions. [2022-11-19 08:24:09,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-19 08:24:09,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:24:09,808 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:24:09,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-19 08:24:10,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:24:10,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-19 08:24:10,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:24:10,418 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:24:10,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:24:10,419 INFO L85 PathProgramCache]: Analyzing trace with hash -490068688, now seen corresponding path program 2 times [2022-11-19 08:24:10,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:24:10,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093649600] [2022-11-19 08:24:10,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:24:10,420 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-19 08:24:10,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:24:10,421 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:24:10,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:24:11,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:24:11,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:24:11,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-19 08:24:11,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:24:11,594 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-19 08:24:11,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:24:13,979 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-19 08:24:13,980 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:24:13,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093649600] [2022-11-19 08:24:13,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093649600] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:24:13,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1004857573] [2022-11-19 08:24:13,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:24:13,980 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:24:13,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:24:13,981 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:24:13,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-11-19 08:24:16,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:24:16,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:24:16,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-19 08:24:16,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:24:16,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-19 08:24:16,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:24:16,834 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-19 08:24:16,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1004857573] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:24:16,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896691416] [2022-11-19 08:24:16,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:24:16,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:24:16,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:24:16,839 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:24:16,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-19 08:24:39,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:24:39,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:24:39,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-19 08:24:39,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:24:39,810 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-19 08:24:39,855 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:24:39,855 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-19 08:24:39,975 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-19 08:24:39,986 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-19 08:24:40,363 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-19 08:24:40,369 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-19 08:24:40,544 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3939) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3938)))) is different from true [2022-11-19 08:24:40,557 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3941))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3940) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:24:40,571 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3943))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3942) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:24:40,585 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3944) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3945)))) is different from true [2022-11-19 08:24:40,598 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3946) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3947) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:24:40,612 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3949 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3949) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3948) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:24:40,767 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3953))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3952)))) is different from true [2022-11-19 08:24:41,032 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3959))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3958) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:24:41,175 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3963 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3963))) (exists ((v_ArrVal_3962 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3962) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:24:41,189 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3964))) (exists ((v_ArrVal_3965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3965)))) is different from true [2022-11-19 08:24:41,203 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3966))) (exists ((v_ArrVal_3967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3967) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32)))) is different from true [2022-11-19 08:24:41,343 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3970))) (exists ((v_ArrVal_3971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3971) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:24:41,736 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3978) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3979) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32)))) is different from true [2022-11-19 08:24:41,747 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3981))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3980) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:24:41,794 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:24:41,795 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-19 08:24:41,801 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-19 08:24:42,005 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-19 08:24:42,014 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-19 08:24:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 217 not checked. [2022-11-19 08:24:42,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:24:42,951 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4029 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4028 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4029 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-19 08:24:42,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896691416] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:24:42,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-19 08:24:42,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 23] total 72 [2022-11-19 08:24:42,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016422371] [2022-11-19 08:24:42,958 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-19 08:24:42,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-19 08:24:42,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:24:42,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-19 08:24:42,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=2836, Unknown=38, NotChecked=1950, Total=5550 [2022-11-19 08:24:42,961 INFO L87 Difference]: Start difference. First operand 5220 states and 7756 transitions. Second operand has 72 states, 71 states have (on average 2.76056338028169) internal successors, (196), 72 states have internal predecessors, (196), 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-19 08:26:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:35,849 INFO L93 Difference]: Finished difference Result 14028 states and 21600 transitions. [2022-11-19 08:26:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-11-19 08:26:35,849 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 2.76056338028169) internal successors, (196), 72 states have internal predecessors, (196), 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 97 [2022-11-19 08:26:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:35,865 INFO L225 Difference]: With dead ends: 14028 [2022-11-19 08:26:35,865 INFO L226 Difference]: Without dead ends: 14018 [2022-11-19 08:26:35,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 405 SyntacticMatches, 10 SemanticMatches, 146 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 3824 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=4129, Invalid=13421, Unknown=66, NotChecked=4140, Total=21756 [2022-11-19 08:26:35,868 INFO L413 NwaCegarLoop]: 1976 mSDtfsCounter, 4108 mSDsluCounter, 54590 mSDsCounter, 0 mSdLazyCounter, 43806 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4125 SdHoareTripleChecker+Valid, 56566 SdHoareTripleChecker+Invalid, 108494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.5s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 43806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64614 IncrementalHoareTripleChecker+Unchecked, 79.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:35,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4125 Valid, 56566 Invalid, 108494 Unknown, 0 Unchecked, 0.5s Time], IncrementalHoareTripleChecker [74 Valid, 43806 Invalid, 0 Unknown, 64614 Unchecked, 79.3s Time] [2022-11-19 08:26:35,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14018 states. [2022-11-19 08:26:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14018 to 5302. [2022-11-19 08:26:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5302 states, 4512 states have (on average 1.7183067375886525) internal successors, (7753), 5254 states have internal predecessors, (7753), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-19 08:26:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5302 states to 5302 states and 7851 transitions. [2022-11-19 08:26:35,982 INFO L78 Accepts]: Start accepts. Automaton has 5302 states and 7851 transitions. Word has length 97 [2022-11-19 08:26:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:35,982 INFO L495 AbstractCegarLoop]: Abstraction has 5302 states and 7851 transitions. [2022-11-19 08:26:35,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 2.76056338028169) internal successors, (196), 72 states have internal predecessors, (196), 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-19 08:26:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 5302 states and 7851 transitions. [2022-11-19 08:26:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-19 08:26:35,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:35,985 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-19 08:26:36,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:26:36,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (44)] Forceful destruction successful, exit code 0 [2022-11-19 08:26:36,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-11-19 08:26:36,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:26:36,609 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:26:36,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:36,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1550768395, now seen corresponding path program 2 times [2022-11-19 08:26:36,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:26:36,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159730199] [2022-11-19 08:26:36,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:26:36,610 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-19 08:26:36,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:26:36,611 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:26:36,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (46)] Waiting until timeout for monitored process [2022-11-19 08:26:37,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 08:26:37,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:26:37,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-19 08:26:37,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:37,247 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-19 08:26:37,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:26:37,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:26:37,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:26:37,260 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 30 treesize of output 39 [2022-11-19 08:26:37,362 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:26:37,363 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-19 08:26:37,465 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 45 treesize of output 41 [2022-11-19 08:26:37,563 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 45 treesize of output 41 [2022-11-19 08:26:37,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:26:37,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-11-19 08:26:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-11-19 08:26:37,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:26:37,709 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:26:37,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159730199] [2022-11-19 08:26:37,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159730199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:37,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:37,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:26:37,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392989858] [2022-11-19 08:26:37,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:37,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:26:37,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:26:37,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:26:37,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:26:37,710 INFO L87 Difference]: Start difference. First operand 5302 states and 7851 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 08:26:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:45,788 INFO L93 Difference]: Finished difference Result 5314 states and 7605 transitions. [2022-11-19 08:26:45,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:26:45,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-11-19 08:26:45,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:45,794 INFO L225 Difference]: With dead ends: 5314 [2022-11-19 08:26:45,794 INFO L226 Difference]: Without dead ends: 5314 [2022-11-19 08:26:45,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:26:45,794 INFO L413 NwaCegarLoop]: 1140 mSDtfsCounter, 1872 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 2799 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1882 SdHoareTripleChecker+Valid, 3754 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:45,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1882 Valid, 3754 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2799 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-11-19 08:26:45,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2022-11-19 08:26:45,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 4902. [2022-11-19 08:26:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4902 states, 4113 states have (on average 1.7415511791879408) internal successors, (7163), 4857 states have internal predecessors, (7163), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-19 08:26:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 7254 transitions. [2022-11-19 08:26:45,837 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 7254 transitions. Word has length 119 [2022-11-19 08:26:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:45,837 INFO L495 AbstractCegarLoop]: Abstraction has 4902 states and 7254 transitions. [2022-11-19 08:26:45,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 08:26:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 7254 transitions. [2022-11-19 08:26:45,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-19 08:26:45,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:45,839 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:45,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (46)] Forceful destruction successful, exit code 0 [2022-11-19 08:26:46,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:26:46,055 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:26:46,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:46,055 INFO L85 PathProgramCache]: Analyzing trace with hash -113709607, now seen corresponding path program 1 times [2022-11-19 08:26:46,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:26:46,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436235308] [2022-11-19 08:26:46,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:46,056 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-19 08:26:46,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:26:46,057 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:26:46,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (47)] Waiting until timeout for monitored process [2022-11-19 08:26:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:47,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-19 08:26:47,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:47,129 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-19 08:26:47,276 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 08:26:47,276 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-19 08:26:47,306 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-19 08:26:47,414 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-19 08:26:47,960 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:26:48,168 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803)))) is different from true [2022-11-19 08:26:48,693 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:26:48,758 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819)))) is different from true [2022-11-19 08:26:48,856 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:26:48,954 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:26:49,165 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:26:49,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-19 08:26:49,285 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:26:49,286 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-19 08:26:49,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 33 treesize of output 15 [2022-11-19 08:26:49,348 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-19 08:26:49,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:51,501 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4830 (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_4830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-19 08:26:51,838 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4830 (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~mem39#1.base| v_ArrVal_4876))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4830)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:26:51,841 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:26:51,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436235308] [2022-11-19 08:26:51,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436235308] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:26:51,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [700661366] [2022-11-19 08:26:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:51,841 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:26:51,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:26:51,842 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:26:51,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-11-19 08:26:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:56,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-19 08:26:56,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:56,582 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-19 08:26:56,752 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 08:26:56,752 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-19 08:26:56,777 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-19 08:26:56,847 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-19 08:26:57,506 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271)))) is different from true [2022-11-19 08:26:57,967 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (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-19 08:26:58,457 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (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|))) is different from true [2022-11-19 08:26:58,741 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:26:58,742 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-19 08:26:58,831 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:26:58,832 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-19 08:26:58,858 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-19 08:26:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-11-19 08:26:58,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:27:01,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [700661366] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:01,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226974375] [2022-11-19 08:27:01,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:01,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:01,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:27:01,355 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:27:01,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-19 08:27:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:02,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-19 08:27:02,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:02,357 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:27:02,357 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-19 08:27:02,401 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-19 08:27:02,576 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5724 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5724))) is different from true [2022-11-19 08:27:02,582 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5725))) is different from true [2022-11-19 08:27:02,588 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5726) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:27:02,593 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5727 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5727))) is different from true [2022-11-19 08:27:02,599 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5728 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5728) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:27:02,604 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5729) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:27:02,610 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5730) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:27:02,616 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5731))) is different from true [2022-11-19 08:27:02,622 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5732))) is different from true [2022-11-19 08:27:02,654 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5733))) is different from true [2022-11-19 08:27:02,661 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5734) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:27:02,667 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5735 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5735))) is different from true [2022-11-19 08:27:02,672 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5736))) is different from true [2022-11-19 08:27:02,678 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5737))) is different from true [2022-11-19 08:27:02,684 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5738) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:27:02,689 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5739) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:27:02,695 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5740))) is different from true [2022-11-19 08:27:02,700 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5741 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5741))) is different from true [2022-11-19 08:27:02,707 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5742))) is different from true [2022-11-19 08:27:02,713 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5743))) is different from true [2022-11-19 08:27:02,719 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5744))) is different from true [2022-11-19 08:27:02,731 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5745))) is different from true [2022-11-19 08:27:02,737 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5746))) is different from true [2022-11-19 08:27:02,743 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5747))) is different from true [2022-11-19 08:27:02,749 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5748))) is different from true [2022-11-19 08:27:02,754 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5749))) is different from true [2022-11-19 08:27:02,760 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5750))) is different from true [2022-11-19 08:27:02,765 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5751))) is different from true [2022-11-19 08:27:02,771 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5752 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5752) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:27:02,777 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5753))) is different from true [2022-11-19 08:27:02,782 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5754))) is different from true [2022-11-19 08:27:02,788 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5755 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5755))) is different from true [2022-11-19 08:27:02,794 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5756))) is different from true [2022-11-19 08:27:02,799 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5757))) is different from true [2022-11-19 08:27:02,805 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5758))) is different from true [2022-11-19 08:27:02,811 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5759))) is different from true [2022-11-19 08:27:02,816 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5760) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:27:02,822 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5761))) is different from true [2022-11-19 08:27:02,828 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5762) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:27:02,833 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5763))) is different from true [2022-11-19 08:27:02,839 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5764))) is different from true [2022-11-19 08:27:02,845 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5765))) is different from true [2022-11-19 08:27:02,850 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5766))) is different from true [2022-11-19 08:27:02,856 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5767 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5767))) is different from true [2022-11-19 08:27:02,883 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:27:02,883 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-19 08:27:02,976 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:27:02,977 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-19 08:27:03,062 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-19 08:27:03,066 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-19 08:27:03,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:27:03,095 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-19 08:27:03,095 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-19 08:27:03,103 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem41#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5768) |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-19 08:27:03,114 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5768 (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_5768) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-19 08:27:03,448 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5768 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5814)) (.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_5768) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-11-19 08:27:03,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226974375] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:03,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:27:03,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 54] total 70 [2022-11-19 08:27:03,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332349732] [2022-11-19 08:27:03,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:27:03,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-19 08:27:03,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:27:03,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-19 08:27:03,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=387, Unknown=84, NotChecked=5510, Total=6162 [2022-11-19 08:27:03,456 INFO L87 Difference]: Start difference. First operand 4902 states and 7254 transitions. Second operand has 71 states, 68 states have (on average 2.764705882352941) internal successors, (188), 71 states have internal predecessors, (188), 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-19 08:27:04,537 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5725))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,543 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5726) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,555 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5727 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5727))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,560 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (exists ((v_ArrVal_5728 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5728) |c_#memory_$Pointer$.base|)) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,566 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5729) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,572 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5730) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,578 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5731))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,584 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5732))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,590 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5733))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,596 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_5734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5734) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,602 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5735 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5735))) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,608 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5736))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,613 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5737))) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,619 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5738) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,625 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_5739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5739) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,630 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5740))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,636 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5741 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5741))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,646 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5742))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,651 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5743))) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,657 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_5744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5744))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,662 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_5745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5745))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,668 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_5746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5746))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,673 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5747))) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,693 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_5748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5748))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,699 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5749))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,705 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_5750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5750))) (exists ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,712 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_5751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5751))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,718 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5752 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5752) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,724 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5753))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,730 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_5754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5754))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,736 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5755 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5755))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:04,743 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|)) (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_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (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))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_5756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5756))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-19 08:27:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:39,786 INFO L93 Difference]: Finished difference Result 13505 states and 20825 transitions. [2022-11-19 08:27:39,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-19 08:27:39,787 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 68 states have (on average 2.764705882352941) internal successors, (188), 71 states have internal predecessors, (188), 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 122 [2022-11-19 08:27:39,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:39,803 INFO L225 Difference]: With dead ends: 13505 [2022-11-19 08:27:39,803 INFO L226 Difference]: Without dead ends: 13501 [2022-11-19 08:27:39,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 226 SyntacticMatches, 84 SemanticMatches, 116 ConstructedPredicates, 90 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=306, Invalid=687, Unknown=123, NotChecked=12690, Total=13806 [2022-11-19 08:27:39,806 INFO L413 NwaCegarLoop]: 2057 mSDtfsCounter, 3967 mSDsluCounter, 19023 mSDsCounter, 0 mSdLazyCounter, 15077 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3985 SdHoareTripleChecker+Valid, 21080 SdHoareTripleChecker+Invalid, 212445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 15077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197324 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:39,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3985 Valid, 21080 Invalid, 212445 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [44 Valid, 15077 Invalid, 0 Unknown, 197324 Unchecked, 34.7s Time] [2022-11-19 08:27:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13501 states. [2022-11-19 08:27:39,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13501 to 4901. [2022-11-19 08:27:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4901 states, 4113 states have (on average 1.7400923899829808) internal successors, (7157), 4856 states have internal predecessors, (7157), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-19 08:27:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4901 states to 4901 states and 7248 transitions. [2022-11-19 08:27:39,909 INFO L78 Accepts]: Start accepts. Automaton has 4901 states and 7248 transitions. Word has length 122 [2022-11-19 08:27:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:39,910 INFO L495 AbstractCegarLoop]: Abstraction has 4901 states and 7248 transitions. [2022-11-19 08:27:39,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 68 states have (on average 2.764705882352941) internal successors, (188), 71 states have internal predecessors, (188), 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-19 08:27:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 4901 states and 7248 transitions. [2022-11-19 08:27:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-19 08:27:39,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:39,911 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:39,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2022-11-19 08:27:40,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (47)] Forceful destruction successful, exit code 0 [2022-11-19 08:27:40,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-19 08:27:40,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:40,530 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-19 08:27:40,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:40,531 INFO L85 PathProgramCache]: Analyzing trace with hash -113709606, now seen corresponding path program 1 times [2022-11-19 08:27:40,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:27:40,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068674426] [2022-11-19 08:27:40,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:40,532 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-19 08:27:40,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:27:40,532 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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-19 08:27:40,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/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 (50)] Waiting until timeout for monitored process [2022-11-19 08:27:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:41,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-19 08:27:41,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:41,641 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-19 08:27:41,806 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-19 08:27:41,820 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:27:41,820 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-19 08:27:41,844 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-19 08:27:41,854 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-19 08:27:41,982 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-19 08:27:41,987 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-19 08:27:42,115 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6198))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6199) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:27:42,128 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6201) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6200)))) is different from true [2022-11-19 08:27:42,141 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6203))) (exists ((v_ArrVal_6202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6202)))) is different from true [2022-11-19 08:27:42,165 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6204) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6205))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-19 08:27:42,256 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211)))) is different from true [2022-11-19 08:27:42,308 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6215))) (exists ((v_ArrVal_6214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6214)))) is different from true [2022-11-19 08:27:42,322 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6216))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-19 08:27:42,342 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218)))) is different from true [2022-11-19 08:27:42,355 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221))) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220)))) is different from true [2022-11-19 08:27:42,368 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6222))) (exists ((v_ArrVal_6223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6223)))) is different from true [2022-11-19 08:27:42,381 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6224 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6224) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6225)))) is different from true [2022-11-19 08:27:42,394 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6226))) (exists ((v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6227)))) is different from true [2022-11-19 08:27:42,407 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6228))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6229)))) is different from true [2022-11-19 08:27:42,420 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6231))) (exists ((v_ArrVal_6230 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6230))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-19 08:27:42,435 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6233))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6232) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:27:42,448 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6235))) (exists ((v_ArrVal_6234 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6234) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:27:42,461 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6236) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6237)))) is different from true [2022-11-19 08:27:42,474 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6239))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6238) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:27:42,486 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6240) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6241 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6241)))) is different from true [2022-11-19 08:27:42,500 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6243))) (exists ((v_ArrVal_6242 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6242)))) is different from true [2022-11-19 08:27:42,514 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6245) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6244)))) is different from true [2022-11-19 08:27:42,528 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6246))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6247) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:27:42,541 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6249) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6248)))) is different from true [2022-11-19 08:27:42,554 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6250))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6251)))) is different from true [2022-11-19 08:27:42,567 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6253))) (exists ((v_ArrVal_6252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6252))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-19 08:27:42,580 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6254))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6255) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:27:42,593 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6257))) (exists ((v_ArrVal_6256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6256)))) is different from true [2022-11-19 08:27:42,607 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6258))) (exists ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6259)))) is different from true [2022-11-19 08:27:42,620 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6261) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-19 08:27:42,632 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6262) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6263)))) is different from true [2022-11-19 08:27:42,645 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6264))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6265)))) is different from true [2022-11-19 08:27:42,667 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6267 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6267))) (exists ((v_ArrVal_6266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6266)))) is different from true [2022-11-19 08:27:42,684 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6268))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6269)))) is different from true [2022-11-19 08:27:42,699 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6271))) (exists ((v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6270))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-19 08:27:42,714 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6272))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6273) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:27:42,728 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6274 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6274))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6275)))) is different from true [2022-11-19 08:27:42,742 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6277))) (exists ((v_ArrVal_6276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6276)))) is different from true [2022-11-19 08:27:42,766 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6278))) (exists ((v_ArrVal_6279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6279))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-19 08:27:42,784 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6281))) (exists ((v_ArrVal_6280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6280) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-19 08:27:42,805 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6283 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6283) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6282))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-19 08:27:42,867 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:27:42,867 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-19 08:27:42,877 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-19 08:27:43,006 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:27:43,006 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-19 08:27:43,013 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-19 08:27:43,059 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-19 08:27:43,066 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-19 08:27:43,101 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-19 08:27:43,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:27:43,301 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-19 08:27:43,341 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_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-19 08:27:44,361 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6377 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6377))) (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~mem39#1.base| v_ArrVal_6376) .cse0 v_ArrVal_6285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6377 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6376) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6377) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-19 08:27:44,375 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:27:44,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068674426] [2022-11-19 08:27:44,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068674426] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:44,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [194529366] [2022-11-19 08:27:44,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:44,375 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:27:44,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:27:44,376 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:27:44,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2022-11-19 08:29:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:51,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-19 08:29:51,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:51,972 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-19 08:29:52,154 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:29:52,154 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-19 08:29:52,162 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-19 08:29:52,176 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-19 08:29:52,191 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-19 08:29:52,267 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-19 08:29:52,273 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-19 08:29:52,345 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (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))) (exists ((v_ArrVal_6760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6760) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:52,362 WARN L859 $PredicateComparison]: unable to prove that (and (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))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6761)))) is different from true [2022-11-19 08:29:52,377 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6764))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (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-19 08:29:52,429 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6768) |c_#memory_$Pointer$.offset|)) (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-19 08:29:52,568 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6776))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (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-19 08:29:52,714 WARN L859 $PredicateComparison]: unable to prove that (and (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))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6783)))) is different from true [2022-11-19 08:29:52,740 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (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))) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786)))) is different from true [2022-11-19 08:29:52,755 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787))) (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-19 08:29:52,770 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6789))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (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-19 08:29:52,785 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.offset|)) (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|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-19 08:29:52,799 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (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|)) (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:52,812 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6796) |c_#memory_$Pointer$.offset|)) (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-19 08:29:52,827 WARN L859 $PredicateComparison]: unable to prove that (and (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|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6798) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:52,840 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6800 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6800) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6799)))) is different from true [2022-11-19 08:29:52,853 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6802))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6801) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:29:52,866 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6803))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6804)))) is different from true [2022-11-19 08:29:52,881 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6805) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6806)))) is different from true [2022-11-19 08:29:52,895 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6807))) (exists ((v_ArrVal_6808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6808)))) is different from true [2022-11-19 08:29:52,908 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6809))) (exists ((v_ArrVal_6810 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6810) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:29:52,922 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6812))) (exists ((v_ArrVal_6811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6811)))) is different from true [2022-11-19 08:29:52,936 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6813))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6814) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:52,950 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6816))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6815) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:52,964 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6817) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6818) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:52,978 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6820 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6820))) (exists ((v_ArrVal_6819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6819)))) is different from true [2022-11-19 08:29:52,992 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6822))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6821)))) is different from true [2022-11-19 08:29:53,006 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6824))) (exists ((v_ArrVal_6823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6823)))) is different from true [2022-11-19 08:29:53,021 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6825 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6825))) (exists ((v_ArrVal_6826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6826) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:53,035 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6828 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6828))) (exists ((v_ArrVal_6827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6827)))) is different from true [2022-11-19 08:29:53,049 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6829))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6830)))) is different from true [2022-11-19 08:29:53,063 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6832))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6831)))) is different from true [2022-11-19 08:29:53,076 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6834))) (exists ((v_ArrVal_6833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6833)))) is different from true [2022-11-19 08:29:53,090 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6836) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6835) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:29:53,103 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6838 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6838) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6837)))) is different from true [2022-11-19 08:29:53,121 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6840))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6839) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:29:53,137 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6842 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6842))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841)))) is different from true [2022-11-19 08:29:53,152 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6843) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:29:53,175 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6845 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6845) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6846 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6846)))) is different from true [2022-11-19 08:29:53,234 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:29:53,234 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-19 08:29:53,242 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-19 08:29:53,331 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:29:53,332 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-19 08:29:53,343 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-19 08:29:53,384 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-19 08:29:53,392 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-19 08:29:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 962 not checked. [2022-11-19 08:29:53,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:29:53,465 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6847 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6848 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-19 08:29:53,506 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_6848 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6847 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-19 08:29:54,492 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6939))) (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~mem39#1.base| v_ArrVal_6940) .cse0 v_ArrVal_6848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6940) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6939) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-19 08:29:54,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [194529366] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:29:54,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445165981] [2022-11-19 08:29:54,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:54,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:54,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:29:54,504 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:29:54,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9762e56-ee3f-43c1-9cb0-f1413785cf77/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-11-19 08:29:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:55,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-19 08:29:55,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:55,550 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:29:55,550 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-19 08:29:55,559 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-19 08:29:55,573 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-19 08:29:55,583 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-19 08:29:55,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 22 treesize of output 10 [2022-11-19 08:29:55,657 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-19 08:29:55,714 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7321 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7321))) (exists ((v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7322)))) is different from true [2022-11-19 08:29:55,727 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7323) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7324)))) is different from true [2022-11-19 08:29:55,773 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7328) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7327)))) is different from true [2022-11-19 08:29:55,789 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7329))) (exists ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7330) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:55,875 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335)))) is different from true [2022-11-19 08:29:55,927 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340)))) is different from true [2022-11-19 08:29:55,942 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341)))) is different from true [2022-11-19 08:29:55,955 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343)))) is different from true [2022-11-19 08:29:55,968 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7345) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7346)))) is different from true [2022-11-19 08:29:55,982 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347))) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:29:56,008 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7350))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7349)))) is different from true [2022-11-19 08:29:56,023 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7351))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7352)))) is different from true [2022-11-19 08:29:56,038 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7353 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7353))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7354) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:56,054 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7355))) (exists ((v_ArrVal_7356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7356) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-19 08:29:56,069 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7357))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7358) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:56,085 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7360) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7359)))) is different from true [2022-11-19 08:29:56,100 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7362))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7361)))) is different from true [2022-11-19 08:29:56,116 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7363 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7363) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7364)))) is different from true [2022-11-19 08:29:56,132 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7365))) (exists ((v_ArrVal_7366 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7366) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:29:56,150 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7367))) (exists ((v_ArrVal_7368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7368)))) is different from true [2022-11-19 08:29:56,165 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7369) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7370 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7370)))) is different from true [2022-11-19 08:29:56,182 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7371) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7372) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:56,197 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7373))) (exists ((v_ArrVal_7374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7374) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:56,212 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7375))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7376)))) is different from true [2022-11-19 08:29:56,228 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7377))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7378) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:56,243 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7379))) (exists ((v_ArrVal_7380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7380)))) is different from true [2022-11-19 08:29:56,258 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7381))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7382)))) is different from true [2022-11-19 08:29:56,274 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7383 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7383) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7384)))) is different from true [2022-11-19 08:29:56,290 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7385))) (exists ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7386)))) is different from true [2022-11-19 08:29:56,305 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7388))) (exists ((v_ArrVal_7387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7387) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:56,320 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7390) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7389))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-19 08:29:56,336 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7391))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7392) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:29:56,352 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7394 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7394) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7393 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7393) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:29:56,367 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7396))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7395) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:56,381 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7398 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7398))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7397)))) is different from true [2022-11-19 08:29:56,394 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7399) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7400 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7400)))) is different from true [2022-11-19 08:29:56,407 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7402))) (exists ((v_ArrVal_7401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7401)))) is different from true [2022-11-19 08:29:56,420 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7403) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7404)))) is different from true [2022-11-19 08:29:56,441 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7405) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7406)))) is different from true [2022-11-19 08:29:56,454 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7407 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7407) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7408)))) is different from true [2022-11-19 08:29:56,501 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:29:56,502 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-19 08:29:56,514 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-19 08:29:56,604 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:29:56,604 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-19 08:29:56,611 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-19 08:29:56,647 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-19 08:29:56,655 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-19 08:29:56,660 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-19 08:29:56,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:29:56,738 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7410 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-19 08:29:56,779 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_7409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7410 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-19 08:29:57,831 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7502))) (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~mem39#1.base| v_ArrVal_7501) .cse0 v_ArrVal_7409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7502 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7501) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7502) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-19 08:29:57,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445165981] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:29:57,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:29:57,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 46, 50] total 127 [2022-11-19 08:29:57,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949137580] [2022-11-19 08:29:57,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:29:57,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2022-11-19 08:29:57,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:29:57,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2022-11-19 08:29:57,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=247, Unknown=132, NotChecked=18522, Total=19182 [2022-11-19 08:29:57,849 INFO L87 Difference]: Start difference. First operand 4901 states and 7248 transitions. Second operand has 128 states, 126 states have (on average 1.8968253968253967) internal successors, (239), 128 states have internal predecessors, (239), 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-19 08:29:58,640 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6776))) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339))) (exists ((v_ArrVal_6197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6197) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7328) |c_#memory_$Pointer$.offset|)) (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))) (exists ((v_ArrVal_6198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6198))) (exists ((v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6196))) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336))) (exists ((v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7323) |c_#memory_$Pointer$.base|)) (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))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6199) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335))) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340))) (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|)) (exists ((v_ArrVal_6215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6215))) (exists ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6783))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6214))) (exists ((v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7327))) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211))) (exists ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7324))) (exists ((v_ArrVal_6761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6761))) (exists ((v_ArrVal_6768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6768) |c_#memory_$Pointer$.offset|)) (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-19 08:29:58,648 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6776))) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339))) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6197) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6216))) (exists ((v_ArrVal_6201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6201) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7328) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6198))) (exists ((v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6196))) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336))) (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))) (exists ((v_ArrVal_6764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6764))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6200))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6199) |c_#memory_$Pointer$.offset|)) (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|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335))) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340))) (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|)) (exists ((v_ArrVal_6215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6215))) (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))) (exists ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6783))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6214))) (exists ((v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7327))) (exists ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7329))) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211))) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341))) (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-19 08:29:58,658 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6776))) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339))) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6197) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) (exists ((v_ArrVal_6216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6216))) (exists ((v_ArrVal_6201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6201) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7328) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6198))) (exists ((v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6196))) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336))) (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))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6203))) (exists ((v_ArrVal_6200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6200))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6199) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335))) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340))) (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|)) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787))) (exists ((v_ArrVal_6215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6215))) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (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))) (exists ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6783))) (exists ((v_ArrVal_6202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6202))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343))) (exists ((v_ArrVal_6214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6214))) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218))) (exists ((v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7327))) (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|)) (exists ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7329))) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211))) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341))) (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-19 08:29:58,668 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6776))) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339))) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6204) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6197) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) (exists ((v_ArrVal_6216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6216))) (exists ((v_ArrVal_6205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6205))) (exists ((v_ArrVal_6201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6201) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7328) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6789))) (exists ((v_ArrVal_6198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6198))) (exists ((v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6196))) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336))) (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))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6203))) (exists ((v_ArrVal_6200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6200))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6199) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335))) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340))) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221))) (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|)) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787))) (exists ((v_ArrVal_6215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6215))) (exists ((v_ArrVal_7345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7345) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (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))) (exists ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6783))) (exists ((v_ArrVal_6202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6202))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343))) (exists ((v_ArrVal_6214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6214))) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218))) (exists ((v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7327))) (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|)) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220))) (exists ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7329))) (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))) (exists ((v_ArrVal_7346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7346))) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211))) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341))) (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-19 08:29:58,679 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6776))) (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339))) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6204) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6197) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) (exists ((v_ArrVal_6216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6216))) (exists ((v_ArrVal_6205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6205))) (exists ((v_ArrVal_6201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6201) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7328) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6789))) (exists ((v_ArrVal_6198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6198))) (exists ((v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6196))) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336))) (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|)) (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))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6203))) (exists ((v_ArrVal_6200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6200))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6199) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335))) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340))) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221))) (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|)) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347))) (exists ((v_ArrVal_6215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6215))) (exists ((v_ArrVal_7345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7345) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (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))) (exists ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6783))) (exists ((v_ArrVal_6202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6202))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343))) (exists ((v_ArrVal_6222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6222))) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6214))) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218))) (exists ((v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7327))) (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|)) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220))) (exists ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7329))) (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))) (exists ((v_ArrVal_7346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7346))) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211))) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341))) (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|)) (exists ((v_ArrVal_6223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6223)))) is different from true [2022-11-19 08:29:58,693 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6776))) (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339))) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6204) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6197) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) (exists ((v_ArrVal_6216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6216))) (exists ((v_ArrVal_6205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6205))) (exists ((v_ArrVal_6201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6201) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7328) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6789))) (exists ((v_ArrVal_6224 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6224) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6198))) (exists ((v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6196))) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336))) (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|)) (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))) (exists ((v_ArrVal_7350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7350))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7349))) (exists ((v_ArrVal_6203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6203))) (exists ((v_ArrVal_6200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6200))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6199) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335))) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340))) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221))) (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|)) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347))) (exists ((v_ArrVal_6215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6215))) (exists ((v_ArrVal_7345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7345) |c_#memory_$Pointer$.offset|)) (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|)) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (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))) (exists ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6783))) (exists ((v_ArrVal_6202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6202))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343))) (exists ((v_ArrVal_6222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6222))) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6214))) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218))) (exists ((v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7327))) (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|)) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220))) (exists ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7329))) (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))) (exists ((v_ArrVal_7346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7346))) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211))) (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6225))) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341))) (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|)) (exists ((v_ArrVal_6223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6223)))) is different from true [2022-11-19 08:30:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:30:20,769 INFO L93 Difference]: Finished difference Result 12935 states and 19987 transitions. [2022-11-19 08:30:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-19 08:30:20,770 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 126 states have (on average 1.8968253968253967) internal successors, (239), 128 states have internal predecessors, (239), 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 122 [2022-11-19 08:30:20,770 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-11-19 08:30:20,771 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 126 states have (on average 1.8968253968253967) internal successors, (239), 128 states have internal predecessors, (239), 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 122