./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI --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 a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:51:05,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:51:05,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:51:05,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:51:05,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:51:05,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:51:05,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:51:05,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:51:05,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:51:05,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:51:05,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:51:05,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:51:05,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:51:05,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:51:05,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:51:05,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:51:05,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:51:05,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:51:05,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:51:05,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:51:05,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:51:05,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:51:05,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:51:05,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:51:05,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:51:05,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:51:05,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:51:05,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:51:05,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:51:05,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:51:05,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:51:05,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:51:05,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:51:05,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:51:05,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:51:05,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:51:05,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:51:05,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:51:05,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:51:05,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:51:05,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:51:05,318 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 03:51:05,365 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:51:05,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:51:05,367 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:51:05,367 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:51:05,369 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:51:05,369 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:51:05,370 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:51:05,370 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:51:05,370 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:51:05,371 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:51:05,372 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:51:05,372 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:51:05,373 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:51:05,373 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:51:05,373 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:51:05,374 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:51:05,374 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:51:05,374 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:51:05,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 03:51:05,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 03:51:05,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:51:05,378 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:51:05,378 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:51:05,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:51:05,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:51:05,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:51:05,379 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 03:51:05,380 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 03:51:05,380 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 03:51:05,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:51:05,381 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 03:51:05,381 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:51:05,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:51:05,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:51:05,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:51:05,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:51:05,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:51:05,383 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:51:05,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:51:05,383 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:51:05,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:51:05,384 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:51:05,384 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_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/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_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI 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 -> a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 [2022-11-03 03:51:05,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:51:05,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:51:05,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:51:05,732 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:51:05,733 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:51:05,735 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2022-11-03 03:51:05,821 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/data/bdd8a8cbe/efed3a2fd0a2491393534a1f35fd6570/FLAGf1157bd42 [2022-11-03 03:51:06,577 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:51:06,583 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2022-11-03 03:51:06,607 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/data/bdd8a8cbe/efed3a2fd0a2491393534a1f35fd6570/FLAGf1157bd42 [2022-11-03 03:51:06,750 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/data/bdd8a8cbe/efed3a2fd0a2491393534a1f35fd6570 [2022-11-03 03:51:06,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:51:06,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:51:06,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:51:06,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:51:06,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:51:06,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:51:06" (1/1) ... [2022-11-03 03:51:06,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc35a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:06, skipping insertion in model container [2022-11-03 03:51:06,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:51:06" (1/1) ... [2022-11-03 03:51:06,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:51:06,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:51:07,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[33021,33034] [2022-11-03 03:51:07,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[49681,49694] [2022-11-03 03:51:07,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:51:07,708 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-03 03:51:07,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@130c8ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:07, skipping insertion in model container [2022-11-03 03:51:07,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:51:07,710 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-03 03:51:07,712 INFO L158 Benchmark]: Toolchain (without parser) took 954.66ms. Allocated memory was 113.2MB in the beginning and 174.1MB in the end (delta: 60.8MB). Free memory was 82.7MB in the beginning and 134.8MB in the end (delta: -52.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 03:51:07,713 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 113.2MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:51:07,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 951.25ms. Allocated memory was 113.2MB in the beginning and 174.1MB in the end (delta: 60.8MB). Free memory was 82.4MB in the beginning and 134.8MB in the end (delta: -52.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 03:51:07,716 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.36ms. Allocated memory is still 113.2MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 951.25ms. Allocated memory was 113.2MB in the beginning and 174.1MB in the end (delta: 60.8MB). Free memory was 82.4MB in the beginning and 134.8MB in the end (delta: -52.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI --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 a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:51:10,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:51:10,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:51:10,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:51:10,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:51:10,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:51:10,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:51:10,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:51:10,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:51:10,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:51:10,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:51:10,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:51:10,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:51:10,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:51:10,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:51:10,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:51:10,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:51:10,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:51:10,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:51:10,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:51:10,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:51:10,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:51:10,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:51:10,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:51:10,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:51:10,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:51:10,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:51:10,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:51:10,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:51:10,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:51:10,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:51:10,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:51:10,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:51:10,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:51:10,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:51:10,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:51:10,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:51:10,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:51:10,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:51:10,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:51:10,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:51:10,473 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-03 03:51:10,532 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:51:10,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:51:10,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:51:10,534 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:51:10,535 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:51:10,535 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:51:10,536 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:51:10,536 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:51:10,536 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:51:10,537 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:51:10,538 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:51:10,539 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:51:10,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 03:51:10,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 03:51:10,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:51:10,542 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:51:10,542 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:51:10,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:51:10,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:51:10,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:51:10,543 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 03:51:10,543 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 03:51:10,544 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 03:51:10,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:51:10,544 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 03:51:10,544 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 03:51:10,545 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 03:51:10,545 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:51:10,545 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:51:10,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:51:10,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 03:51:10,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:51:10,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:51:10,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:51:10,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:51:10,548 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 03:51:10,548 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 03:51:10,549 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:51:10,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 03:51:10,549 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_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/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_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI 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 -> a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 [2022-11-03 03:51:11,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:51:11,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:51:11,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:51:11,078 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:51:11,079 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:51:11,081 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2022-11-03 03:51:11,178 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/data/fb16ecdb9/b70c36626ef04ad58e75b66e426dc44a/FLAGf3ee9dc10 [2022-11-03 03:51:12,067 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:51:12,068 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2022-11-03 03:51:12,103 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/data/fb16ecdb9/b70c36626ef04ad58e75b66e426dc44a/FLAGf3ee9dc10 [2022-11-03 03:51:12,221 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/data/fb16ecdb9/b70c36626ef04ad58e75b66e426dc44a [2022-11-03 03:51:12,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:51:12,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:51:12,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:51:12,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:51:12,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:51:12,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:51:12" (1/1) ... [2022-11-03 03:51:12,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37aa10a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:12, skipping insertion in model container [2022-11-03 03:51:12,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:51:12" (1/1) ... [2022-11-03 03:51:12,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:51:12,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:51:13,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[33021,33034] [2022-11-03 03:51:13,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[49681,49694] [2022-11-03 03:51:13,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:51:13,333 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-03 03:51:13,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:51:13,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[33021,33034] [2022-11-03 03:51:13,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[49681,49694] [2022-11-03 03:51:13,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:51:13,598 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:51:13,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[33021,33034] [2022-11-03 03:51:13,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i[49681,49694] [2022-11-03 03:51:13,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:51:13,820 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:51:13,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:13 WrapperNode [2022-11-03 03:51:13,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:51:13,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:51:13,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:51:13,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:51:13,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:13" (1/1) ... [2022-11-03 03:51:13,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:13" (1/1) ... [2022-11-03 03:51:13,977 INFO L138 Inliner]: procedures = 180, calls = 487, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1721 [2022-11-03 03:51:13,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:51:13,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:51:13,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:51:13,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:51:13,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:13" (1/1) ... [2022-11-03 03:51:13,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:13" (1/1) ... [2022-11-03 03:51:14,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:13" (1/1) ... [2022-11-03 03:51:14,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:13" (1/1) ... [2022-11-03 03:51:14,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:13" (1/1) ... [2022-11-03 03:51:14,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:13" (1/1) ... [2022-11-03 03:51:14,232 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:13" (1/1) ... [2022-11-03 03:51:14,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:13" (1/1) ... [2022-11-03 03:51:14,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:51:14,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:51:14,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:51:14,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:51:14,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:13" (1/1) ... [2022-11-03 03:51:14,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:51:14,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:14,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:51:14,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:51:14,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-03 03:51:14,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 03:51:14,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-03 03:51:14,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-03 03:51:14,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-03 03:51:14,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-03 03:51:14,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:51:14,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:51:14,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 03:51:14,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:51:14,357 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-03 03:51:14,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 03:51:14,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:51:14,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 03:51:14,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 03:51:14,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:51:14,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:51:14,759 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:51:14,762 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:51:14,767 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:51:25,052 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:51:25,081 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:51:25,081 INFO L300 CfgBuilder]: Removed 100 assume(true) statements. [2022-11-03 03:51:25,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:51:25 BoogieIcfgContainer [2022-11-03 03:51:25,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:51:25,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:51:25,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:51:25,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:51:25,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:51:12" (1/3) ... [2022-11-03 03:51:25,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb1389e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:51:25, skipping insertion in model container [2022-11-03 03:51:25,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:13" (2/3) ... [2022-11-03 03:51:25,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb1389e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:51:25, skipping insertion in model container [2022-11-03 03:51:25,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:51:25" (3/3) ... [2022-11-03 03:51:25,109 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-3.i [2022-11-03 03:51:25,131 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:51:25,132 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 932 error locations. [2022-11-03 03:51:25,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:51:25,288 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;@4f0ac6ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:51:25,288 INFO L358 AbstractCegarLoop]: Starting to check reachability of 932 error locations. [2022-11-03 03:51:25,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 1833 states, 893 states have (on average 2.2642777155655094) internal successors, (2022), 1824 states have internal predecessors, (2022), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:51:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:51:25,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:25,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:51:25,314 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:51:25,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-11-03 03:51:25,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:51:25,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192420718] [2022-11-03 03:51:25,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:25,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:51:25,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:51:25,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:51:25,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 03:51:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:25,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-03 03:51:25,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:25,719 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-03 03:51:25,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:51:25,720 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:51:25,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192420718] [2022-11-03 03:51:25,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192420718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:25,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:25,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:51:25,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594512693] [2022-11-03 03:51:25,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:25,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 03:51:25,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:51:25,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 03:51:25,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 03:51:25,781 INFO L87 Difference]: Start difference. First operand has 1833 states, 893 states have (on average 2.2642777155655094) internal successors, (2022), 1824 states have internal predecessors, (2022), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:25,880 INFO L93 Difference]: Finished difference Result 1815 states and 1917 transitions. [2022-11-03 03:51:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 03:51:25,883 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 03:51:25,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:25,913 INFO L225 Difference]: With dead ends: 1815 [2022-11-03 03:51:25,913 INFO L226 Difference]: Without dead ends: 1813 [2022-11-03 03:51:25,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 03:51:25,920 INFO L413 NwaCegarLoop]: 1917 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:25,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:51:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2022-11-03 03:51:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1813. [2022-11-03 03:51:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 884 states have (on average 2.1414027149321266) internal successors, (1893), 1804 states have internal predecessors, (1893), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:51:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 1915 transitions. [2022-11-03 03:51:26,067 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 1915 transitions. Word has length 5 [2022-11-03 03:51:26,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:26,068 INFO L495 AbstractCegarLoop]: Abstraction has 1813 states and 1915 transitions. [2022-11-03 03:51:26,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 1915 transitions. [2022-11-03 03:51:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:51:26,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:26,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:51:26,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-03 03:51:26,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:51:26,270 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:51:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:26,270 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-11-03 03:51:26,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:51:26,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653641674] [2022-11-03 03:51:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:26,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:51:26,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:51:26,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:51:26,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 03:51:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:26,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:51:26,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:26,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 03:51:26,691 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-03 03:51:26,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:51:26,691 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:51:26,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653641674] [2022-11-03 03:51:26,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653641674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:26,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:26,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:51:26,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006219515] [2022-11-03 03:51:26,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:26,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:51:26,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:51:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:51:26,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:51:26,695 INFO L87 Difference]: Start difference. First operand 1813 states and 1915 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:31,666 INFO L93 Difference]: Finished difference Result 2069 states and 2214 transitions. [2022-11-03 03:51:31,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:51:31,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 03:51:31,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:31,678 INFO L225 Difference]: With dead ends: 2069 [2022-11-03 03:51:31,678 INFO L226 Difference]: Without dead ends: 2069 [2022-11-03 03:51:31,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:51:31,680 INFO L413 NwaCegarLoop]: 1354 mSDtfsCounter, 1369 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:31,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 1809 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-03 03:51:31,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2022-11-03 03:51:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1798. [2022-11-03 03:51:31,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 960 states have (on average 2.017708333333333) internal successors, (1937), 1789 states have internal predecessors, (1937), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:51:31,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 1959 transitions. [2022-11-03 03:51:31,762 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 1959 transitions. Word has length 5 [2022-11-03 03:51:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:31,763 INFO L495 AbstractCegarLoop]: Abstraction has 1798 states and 1959 transitions. [2022-11-03 03:51:31,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:31,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 1959 transitions. [2022-11-03 03:51:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:51:31,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:31,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:51:31,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-03 03:51:31,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:51:31,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:51:31,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-11-03 03:51:31,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:51:31,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673680498] [2022-11-03 03:51:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:31,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:51:31,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:51:31,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:51:31,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 03:51:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:32,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:51:32,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:32,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:51:32,269 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-03 03:51:32,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:51:32,270 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:51:32,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673680498] [2022-11-03 03:51:32,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673680498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:32,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:32,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:51:32,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043275824] [2022-11-03 03:51:32,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:32,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:51:32,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:51:32,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:51:32,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:51:32,277 INFO L87 Difference]: Start difference. First operand 1798 states and 1959 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:38,986 INFO L93 Difference]: Finished difference Result 2318 states and 2529 transitions. [2022-11-03 03:51:38,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:51:38,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 03:51:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:39,000 INFO L225 Difference]: With dead ends: 2318 [2022-11-03 03:51:39,002 INFO L226 Difference]: Without dead ends: 2318 [2022-11-03 03:51:39,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:51:39,009 INFO L413 NwaCegarLoop]: 1746 mSDtfsCounter, 741 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:39,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 2548 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-11-03 03:51:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-11-03 03:51:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1954. [2022-11-03 03:51:39,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1126 states have (on average 1.992007104795737) internal successors, (2243), 1945 states have internal predecessors, (2243), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:51:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2265 transitions. [2022-11-03 03:51:39,081 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2265 transitions. Word has length 5 [2022-11-03 03:51:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:39,081 INFO L495 AbstractCegarLoop]: Abstraction has 1954 states and 2265 transitions. [2022-11-03 03:51:39,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2265 transitions. [2022-11-03 03:51:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 03:51:39,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:39,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 03:51:39,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:39,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:51:39,294 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:51:39,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:39,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2022-11-03 03:51:39,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:51:39,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490029763] [2022-11-03 03:51:39,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:39,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:51:39,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:51:39,297 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:51:39,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 03:51:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:39,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 03:51:39,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:39,514 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-03 03:51:39,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:51:39,515 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:51:39,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490029763] [2022-11-03 03:51:39,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490029763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:39,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:39,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:51:39,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402145594] [2022-11-03 03:51:39,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:39,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:51:39,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:51:39,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:51:39,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:51:39,529 INFO L87 Difference]: Start difference. First operand 1954 states and 2265 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:39,729 INFO L93 Difference]: Finished difference Result 3514 states and 4117 transitions. [2022-11-03 03:51:39,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:51:39,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-03 03:51:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:39,748 INFO L225 Difference]: With dead ends: 3514 [2022-11-03 03:51:39,749 INFO L226 Difference]: Without dead ends: 3514 [2022-11-03 03:51:39,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:51:39,750 INFO L413 NwaCegarLoop]: 2266 mSDtfsCounter, 1377 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 4069 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:39,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 4069 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:51:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2022-11-03 03:51:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 1956. [2022-11-03 03:51:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1128 states have (on average 1.9902482269503545) internal successors, (2245), 1947 states have internal predecessors, (2245), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:51:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2267 transitions. [2022-11-03 03:51:39,815 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2267 transitions. Word has length 6 [2022-11-03 03:51:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:39,815 INFO L495 AbstractCegarLoop]: Abstraction has 1956 states and 2267 transitions. [2022-11-03 03:51:39,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:39,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2267 transitions. [2022-11-03 03:51:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:51:39,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:39,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:39,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:40,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:51:40,030 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:51:40,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:40,031 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-11-03 03:51:40,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:51:40,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259613027] [2022-11-03 03:51:40,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:40,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:51:40,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:51:40,037 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:51:40,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 03:51:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:40,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 03:51:40,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:40,340 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-03 03:51:40,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:51:40,340 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:51:40,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259613027] [2022-11-03 03:51:40,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259613027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:40,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:40,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:51:40,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130905421] [2022-11-03 03:51:40,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:40,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:51:40,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:51:40,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:51:40,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:51:40,343 INFO L87 Difference]: Start difference. First operand 1956 states and 2267 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-03 03:51:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:40,404 INFO L93 Difference]: Finished difference Result 1920 states and 2230 transitions. [2022-11-03 03:51:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:51:40,405 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-03 03:51:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:40,413 INFO L225 Difference]: With dead ends: 1920 [2022-11-03 03:51:40,414 INFO L226 Difference]: Without dead ends: 1920 [2022-11-03 03:51:40,414 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-03 03:51:40,415 INFO L413 NwaCegarLoop]: 1766 mSDtfsCounter, 1736 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 1794 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-03 03:51:40,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1747 Valid, 1794 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:51:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2022-11-03 03:51:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1914. [2022-11-03 03:51:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1110 states have (on average 1.9837837837837837) internal successors, (2202), 1905 states have internal predecessors, (2202), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:51:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2224 transitions. [2022-11-03 03:51:40,466 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2224 transitions. Word has length 11 [2022-11-03 03:51:40,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:40,467 INFO L495 AbstractCegarLoop]: Abstraction has 1914 states and 2224 transitions. [2022-11-03 03:51:40,467 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-03 03:51:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2224 transitions. [2022-11-03 03:51:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:51:40,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:40,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:40,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:40,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:51:40,681 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:51:40,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:40,682 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-11-03 03:51:40,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:51:40,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309895452] [2022-11-03 03:51:40,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:40,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:51:40,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:51:40,684 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:51:40,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 03:51:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:40,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:51:40,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:41,018 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-03 03:51:41,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:51:41,019 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:51:41,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309895452] [2022-11-03 03:51:41,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309895452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:41,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:41,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:51:41,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243796759] [2022-11-03 03:51:41,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:41,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:51:41,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:51:41,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:51:41,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:51:41,022 INFO L87 Difference]: Start difference. First operand 1914 states and 2224 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-03 03:51:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:41,153 INFO L93 Difference]: Finished difference Result 1899 states and 2202 transitions. [2022-11-03 03:51:41,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:51:41,154 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-03 03:51:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:41,162 INFO L225 Difference]: With dead ends: 1899 [2022-11-03 03:51:41,162 INFO L226 Difference]: Without dead ends: 1899 [2022-11-03 03:51:41,163 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-03 03:51:41,164 INFO L413 NwaCegarLoop]: 1721 mSDtfsCounter, 1707 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:41,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 3463 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:51:41,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-11-03 03:51:41,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1892. [2022-11-03 03:51:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1102 states have (on average 1.971869328493648) internal successors, (2173), 1883 states have internal predecessors, (2173), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:51:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2195 transitions. [2022-11-03 03:51:41,213 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2195 transitions. Word has length 13 [2022-11-03 03:51:41,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:41,214 INFO L495 AbstractCegarLoop]: Abstraction has 1892 states and 2195 transitions. [2022-11-03 03:51:41,214 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-03 03:51:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2195 transitions. [2022-11-03 03:51:41,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 03:51:41,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:41,216 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-03 03:51:41,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:41,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:51:41,431 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:51:41,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:41,432 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-11-03 03:51:41,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:51:41,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952342392] [2022-11-03 03:51:41,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:41,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:51:41,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:51:41,434 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:51:41,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 03:51:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:41,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:51:41,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:41,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 03:51:41,846 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-03 03:51:41,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:51:41,847 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:51:41,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952342392] [2022-11-03 03:51:41,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952342392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:41,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:41,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:51:41,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451967861] [2022-11-03 03:51:41,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:41,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:51:41,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:51:41,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:51:41,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:51:41,849 INFO L87 Difference]: Start difference. First operand 1892 states and 2195 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-03 03:51:49,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:49,245 INFO L93 Difference]: Finished difference Result 3106 states and 3455 transitions. [2022-11-03 03:51:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:51:49,246 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-03 03:51:49,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:49,260 INFO L225 Difference]: With dead ends: 3106 [2022-11-03 03:51:49,260 INFO L226 Difference]: Without dead ends: 3106 [2022-11-03 03:51:49,261 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-03 03:51:49,262 INFO L413 NwaCegarLoop]: 1071 mSDtfsCounter, 3382 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3390 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:49,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3390 Valid, 2422 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-11-03 03:51:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2022-11-03 03:51:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 1888. [2022-11-03 03:51:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1102 states have (on average 1.9682395644283122) internal successors, (2169), 1879 states have internal predecessors, (2169), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:51:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2191 transitions. [2022-11-03 03:51:49,318 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2191 transitions. Word has length 27 [2022-11-03 03:51:49,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:49,319 INFO L495 AbstractCegarLoop]: Abstraction has 1888 states and 2191 transitions. [2022-11-03 03:51:49,319 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-03 03:51:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2191 transitions. [2022-11-03 03:51:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 03:51:49,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:49,320 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-03 03:51:49,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:49,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:51:49,534 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:51:49,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:49,534 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-11-03 03:51:49,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:51:49,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305447191] [2022-11-03 03:51:49,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:49,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:51:49,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:51:49,537 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:51:49,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 03:51:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:49,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:51:49,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:49,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:51:50,101 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-03 03:51:50,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:51:50,102 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:51:50,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305447191] [2022-11-03 03:51:50,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305447191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:50,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:50,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:51:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092178611] [2022-11-03 03:51:50,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:50,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:51:50,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:51:50,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:51:50,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:51:50,104 INFO L87 Difference]: Start difference. First operand 1888 states and 2191 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-03 03:51:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:59,188 INFO L93 Difference]: Finished difference Result 2634 states and 2855 transitions. [2022-11-03 03:51:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:51:59,189 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-03 03:51:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:59,197 INFO L225 Difference]: With dead ends: 2634 [2022-11-03 03:51:59,197 INFO L226 Difference]: Without dead ends: 2634 [2022-11-03 03:51:59,197 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-03 03:51:59,198 INFO L413 NwaCegarLoop]: 1272 mSDtfsCounter, 1687 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:59,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 2885 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2022-11-03 03:51:59,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2022-11-03 03:51:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1884. [2022-11-03 03:51:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1102 states have (on average 1.9646098003629764) internal successors, (2165), 1875 states have internal predecessors, (2165), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:51:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2187 transitions. [2022-11-03 03:51:59,245 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2187 transitions. Word has length 27 [2022-11-03 03:51:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:59,246 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 2187 transitions. [2022-11-03 03:51:59,246 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-03 03:51:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2187 transitions. [2022-11-03 03:51:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 03:51:59,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:59,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:59,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:59,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:51:59,464 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:51:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:59,464 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-11-03 03:51:59,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:51:59,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502076928] [2022-11-03 03:51:59,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:59,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:51:59,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:51:59,469 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:51:59,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 03:51:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:59,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:51:59,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:59,918 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-03 03:51:59,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:51:59,919 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:51:59,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502076928] [2022-11-03 03:51:59,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502076928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:59,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:59,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:51:59,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110500454] [2022-11-03 03:51:59,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:59,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:51:59,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:51:59,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:51:59,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:51:59,923 INFO L87 Difference]: Start difference. First operand 1884 states and 2187 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:00,017 INFO L93 Difference]: Finished difference Result 1884 states and 2183 transitions. [2022-11-03 03:52:00,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:52:00,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-03 03:52:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:00,047 INFO L225 Difference]: With dead ends: 1884 [2022-11-03 03:52:00,048 INFO L226 Difference]: Without dead ends: 1884 [2022-11-03 03:52:00,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:52:00,051 INFO L413 NwaCegarLoop]: 1715 mSDtfsCounter, 1683 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:00,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 3441 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:52:00,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2022-11-03 03:52:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1878. [2022-11-03 03:52:00,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1096 states have (on average 1.9662408759124088) internal successors, (2155), 1869 states have internal predecessors, (2155), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:52:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2177 transitions. [2022-11-03 03:52:00,094 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2177 transitions. Word has length 42 [2022-11-03 03:52:00,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:00,096 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2177 transitions. [2022-11-03 03:52:00,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2177 transitions. [2022-11-03 03:52:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 03:52:00,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:00,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:00,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:00,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:52:00,328 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:52:00,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:00,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-11-03 03:52:00,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:52:00,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085000020] [2022-11-03 03:52:00,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:00,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:52:00,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:52:00,332 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:52:00,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 03:52:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:00,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:52:00,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:01,001 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-03 03:52:01,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:52:01,001 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:52:01,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085000020] [2022-11-03 03:52:01,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085000020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:52:01,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:52:01,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:52:01,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335895738] [2022-11-03 03:52:01,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:52:01,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:52:01,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:52:01,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:52:01,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:52:01,004 INFO L87 Difference]: Start difference. First operand 1878 states and 2177 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:01,342 INFO L93 Difference]: Finished difference Result 2297 states and 2613 transitions. [2022-11-03 03:52:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:52:01,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-11-03 03:52:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:01,350 INFO L225 Difference]: With dead ends: 2297 [2022-11-03 03:52:01,350 INFO L226 Difference]: Without dead ends: 2297 [2022-11-03 03:52:01,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:52:01,351 INFO L413 NwaCegarLoop]: 1793 mSDtfsCounter, 455 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:01,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 3382 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:52:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2022-11-03 03:52:01,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 1924. [2022-11-03 03:52:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1142 states have (on average 1.9273204903677759) internal successors, (2201), 1915 states have internal predecessors, (2201), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:52:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2223 transitions. [2022-11-03 03:52:01,392 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2223 transitions. Word has length 50 [2022-11-03 03:52:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:01,393 INFO L495 AbstractCegarLoop]: Abstraction has 1924 states and 2223 transitions. [2022-11-03 03:52:01,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2223 transitions. [2022-11-03 03:52:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-03 03:52:01,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:01,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:01,418 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:01,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:52:01,610 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:52:01,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:01,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-11-03 03:52:01,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:52:01,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497372999] [2022-11-03 03:52:01,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:01,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:52:01,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:52:01,613 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:52:01,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-03 03:52:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:02,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:52:02,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:02,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 03:52:02,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:52:02,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:52:02,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 03:52:02,866 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:52:02,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 03:52:02,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-03 03:52:02,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:52:02,890 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:52:02,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497372999] [2022-11-03 03:52:02,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497372999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:52:02,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:52:02,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:52:02,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575216385] [2022-11-03 03:52:02,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:52:02,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:52:02,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:52:02,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:52:02,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:52:02,893 INFO L87 Difference]: Start difference. First operand 1924 states and 2223 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:09,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:09,265 INFO L93 Difference]: Finished difference Result 2111 states and 2394 transitions. [2022-11-03 03:52:09,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:52:09,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-11-03 03:52:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:09,275 INFO L225 Difference]: With dead ends: 2111 [2022-11-03 03:52:09,275 INFO L226 Difference]: Without dead ends: 2111 [2022-11-03 03:52:09,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:52:09,276 INFO L413 NwaCegarLoop]: 817 mSDtfsCounter, 1569 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:09,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 1308 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-11-03 03:52:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2022-11-03 03:52:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1674. [2022-11-03 03:52:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 976 states have (on average 1.8442622950819672) internal successors, (1800), 1665 states have internal predecessors, (1800), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:52:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 1822 transitions. [2022-11-03 03:52:09,332 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 1822 transitions. Word has length 53 [2022-11-03 03:52:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:09,333 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 1822 transitions. [2022-11-03 03:52:09,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 1822 transitions. [2022-11-03 03:52:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-03 03:52:09,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:09,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:09,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:09,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:52:09,559 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:52:09,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:09,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-11-03 03:52:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:52:09,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865637305] [2022-11-03 03:52:09,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:09,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:52:09,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:52:09,568 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:52:09,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-03 03:52:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:09,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:52:09,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:10,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 03:52:10,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:52:10,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:52:10,076 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-03 03:52:10,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:52:10,076 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:52:10,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865637305] [2022-11-03 03:52:10,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865637305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:52:10,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:52:10,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:52:10,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239316434] [2022-11-03 03:52:10,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:52:10,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:52:10,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:52:10,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:52:10,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:52:10,079 INFO L87 Difference]: Start difference. First operand 1674 states and 1822 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:16,388 INFO L93 Difference]: Finished difference Result 1673 states and 1821 transitions. [2022-11-03 03:52:16,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:52:16,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-03 03:52:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:16,394 INFO L225 Difference]: With dead ends: 1673 [2022-11-03 03:52:16,395 INFO L226 Difference]: Without dead ends: 1673 [2022-11-03 03:52:16,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:52:16,396 INFO L413 NwaCegarLoop]: 1635 mSDtfsCounter, 4 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4160 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:16,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4160 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-03 03:52:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2022-11-03 03:52:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2022-11-03 03:52:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 976 states have (on average 1.8432377049180328) internal successors, (1799), 1664 states have internal predecessors, (1799), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:52:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 1821 transitions. [2022-11-03 03:52:16,428 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 1821 transitions. Word has length 58 [2022-11-03 03:52:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:16,428 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 1821 transitions. [2022-11-03 03:52:16,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 1821 transitions. [2022-11-03 03:52:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-03 03:52:16,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:16,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:16,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:16,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:52:16,649 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:52:16,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:16,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-11-03 03:52:16,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:52:16,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158518815] [2022-11-03 03:52:16,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:16,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:52:16,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:52:16,652 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:52:16,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-03 03:52:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:17,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 03:52:17,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:17,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:52:17,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:52:17,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:52:17,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-03 03:52:17,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 03:52:17,270 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-03 03:52:17,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:52:17,270 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:52:17,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158518815] [2022-11-03 03:52:17,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158518815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:52:17,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:52:17,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:52:17,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5425128] [2022-11-03 03:52:17,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:52:17,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:52:17,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:52:17,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:52:17,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:52:17,273 INFO L87 Difference]: Start difference. First operand 1673 states and 1821 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:25,776 INFO L93 Difference]: Finished difference Result 1672 states and 1820 transitions. [2022-11-03 03:52:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:52:25,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-03 03:52:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:25,782 INFO L225 Difference]: With dead ends: 1672 [2022-11-03 03:52:25,782 INFO L226 Difference]: Without dead ends: 1672 [2022-11-03 03:52:25,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:52:25,783 INFO L413 NwaCegarLoop]: 1635 mSDtfsCounter, 2 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4218 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:25,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4218 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-11-03 03:52:25,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2022-11-03 03:52:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1672. [2022-11-03 03:52:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 975 states have (on average 1.8441025641025641) internal successors, (1798), 1663 states have internal predecessors, (1798), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:52:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1820 transitions. [2022-11-03 03:52:25,815 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1820 transitions. Word has length 58 [2022-11-03 03:52:25,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:25,816 INFO L495 AbstractCegarLoop]: Abstraction has 1672 states and 1820 transitions. [2022-11-03 03:52:25,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1820 transitions. [2022-11-03 03:52:25,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-03 03:52:25,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:25,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:25,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:26,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:52:26,036 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:52:26,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1810601854, now seen corresponding path program 1 times [2022-11-03 03:52:26,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:52:26,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764997517] [2022-11-03 03:52:26,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:26,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:52:26,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:52:26,039 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:52:26,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-03 03:52:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:26,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:52:26,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:26,537 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-03 03:52:26,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:52:26,537 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:52:26,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764997517] [2022-11-03 03:52:26,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764997517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:52:26,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:52:26,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:52:26,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221576832] [2022-11-03 03:52:26,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:52:26,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:52:26,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:52:26,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:52:26,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:52:26,542 INFO L87 Difference]: Start difference. First operand 1672 states and 1820 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:52:26,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:26,639 INFO L93 Difference]: Finished difference Result 1675 states and 1825 transitions. [2022-11-03 03:52:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:52:26,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-11-03 03:52:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:26,648 INFO L225 Difference]: With dead ends: 1675 [2022-11-03 03:52:26,648 INFO L226 Difference]: Without dead ends: 1675 [2022-11-03 03:52:26,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:52:26,650 INFO L413 NwaCegarLoop]: 1634 mSDtfsCounter, 2 mSDsluCounter, 3260 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4894 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-03 03:52:26,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4894 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:52:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2022-11-03 03:52:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675. [2022-11-03 03:52:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 977 states have (on average 1.8433981576253837) internal successors, (1801), 1666 states have internal predecessors, (1801), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 03:52:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 1825 transitions. [2022-11-03 03:52:26,710 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 1825 transitions. Word has length 66 [2022-11-03 03:52:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:26,711 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 1825 transitions. [2022-11-03 03:52:26,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:52:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1825 transitions. [2022-11-03 03:52:26,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 03:52:26,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:26,713 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-03 03:52:26,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:26,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:52:26,914 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:52:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:26,914 INFO L85 PathProgramCache]: Analyzing trace with hash 279721407, now seen corresponding path program 1 times [2022-11-03 03:52:26,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:52:26,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452145082] [2022-11-03 03:52:26,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:26,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:52:26,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:52:26,917 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:52:26,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-03 03:52:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:27,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:52:27,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:27,456 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-03 03:52:27,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:52:27,591 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-03 03:52:27,591 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:52:27,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452145082] [2022-11-03 03:52:27,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452145082] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:52:27,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1191907625] [2022-11-03 03:52:27,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:27,592 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:52:27,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:52:27,600 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:52:27,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-03 03:52:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:28,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:52:28,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:28,363 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-03 03:52:28,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:52:28,426 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-03 03:52:28,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1191907625] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:52:28,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801622445] [2022-11-03 03:52:28,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:28,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:28,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:52:28,433 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:52:28,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 03:52:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:28,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:52:28,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:28,913 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-03 03:52:28,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:52:28,976 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-03 03:52:28,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801622445] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:52:28,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 03:52:28,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-03 03:52:28,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849073740] [2022-11-03 03:52:28,977 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 03:52:28,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:52:28,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:52:28,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:52:28,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:52:28,980 INFO L87 Difference]: Start difference. First operand 1675 states and 1825 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:52:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:29,358 INFO L93 Difference]: Finished difference Result 1687 states and 1843 transitions. [2022-11-03 03:52:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 03:52:29,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-11-03 03:52:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:29,367 INFO L225 Difference]: With dead ends: 1687 [2022-11-03 03:52:29,367 INFO L226 Difference]: Without dead ends: 1687 [2022-11-03 03:52:29,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:52:29,369 INFO L413 NwaCegarLoop]: 1634 mSDtfsCounter, 15 mSDsluCounter, 8137 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 9771 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:29,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 9771 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:52:29,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2022-11-03 03:52:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1685. [2022-11-03 03:52:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 986 states have (on average 1.841784989858012) internal successors, (1816), 1675 states have internal predecessors, (1816), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 03:52:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 1840 transitions. [2022-11-03 03:52:29,408 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 1840 transitions. Word has length 67 [2022-11-03 03:52:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:29,409 INFO L495 AbstractCegarLoop]: Abstraction has 1685 states and 1840 transitions. [2022-11-03 03:52:29,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:52:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 1840 transitions. [2022-11-03 03:52:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-03 03:52:29,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:29,410 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:29,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:29,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:29,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:30,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:30,030 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:52:30,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:30,031 INFO L85 PathProgramCache]: Analyzing trace with hash -431906882, now seen corresponding path program 2 times [2022-11-03 03:52:30,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:52:30,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789528242] [2022-11-03 03:52:30,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:52:30,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:52:30,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:52:30,035 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:52:30,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-03 03:52:30,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 03:52:30,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:52:30,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:52:30,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:30,906 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-03 03:52:30,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:52:31,209 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-03 03:52:31,209 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:52:31,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789528242] [2022-11-03 03:52:31,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789528242] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:52:31,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [136289603] [2022-11-03 03:52:31,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:52:31,210 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:52:31,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:52:31,211 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:52:31,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-03 03:52:33,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 03:52:33,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:52:33,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:52:33,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:33,205 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-03 03:52:33,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:52:33,324 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-03 03:52:33,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [136289603] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:52:33,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162632719] [2022-11-03 03:52:33,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:52:33,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:33,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:52:33,327 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:52:33,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 03:52:55,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 03:52:55,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:52:55,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 03:52:55,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:55,312 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:52:55,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 03:52:55,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:52:56,035 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:52:56,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 03:52:56,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 03:52:56,210 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-03 03:52:56,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:52:56,396 INFO L356 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-03 03:52:56,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 03:52:56,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2022-11-03 03:52:56,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162632719] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:52:56,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 03:52:56,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-03 03:52:56,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930323518] [2022-11-03 03:52:56,413 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 03:52:56,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 03:52:56,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:52:56,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 03:52:56,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-11-03 03:52:56,415 INFO L87 Difference]: Start difference. First operand 1685 states and 1840 transitions. Second operand has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 03:53:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:33,134 INFO L93 Difference]: Finished difference Result 3337 states and 3618 transitions. [2022-11-03 03:53:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-03 03:53:33,135 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 70 [2022-11-03 03:53:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:33,146 INFO L225 Difference]: With dead ends: 3337 [2022-11-03 03:53:33,146 INFO L226 Difference]: Without dead ends: 3337 [2022-11-03 03:53:33,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=318, Invalid=1916, Unknown=26, NotChecked=92, Total=2352 [2022-11-03 03:53:33,148 INFO L413 NwaCegarLoop]: 1618 mSDtfsCounter, 2627 mSDsluCounter, 19545 mSDsCounter, 0 mSdLazyCounter, 15222 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2639 SdHoareTripleChecker+Valid, 21163 SdHoareTripleChecker+Invalid, 16648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 15222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1352 IncrementalHoareTripleChecker+Unchecked, 34.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:33,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2639 Valid, 21163 Invalid, 16648 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [74 Valid, 15222 Invalid, 0 Unknown, 1352 Unchecked, 34.9s Time] [2022-11-03 03:53:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2022-11-03 03:53:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 1691. [2022-11-03 03:53:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 992 states have (on average 1.840725806451613) internal successors, (1826), 1681 states have internal predecessors, (1826), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) [2022-11-03 03:53:33,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 1851 transitions. [2022-11-03 03:53:33,192 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 1851 transitions. Word has length 70 [2022-11-03 03:53:33,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:33,193 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 1851 transitions. [2022-11-03 03:53:33,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 03:53:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 1851 transitions. [2022-11-03 03:53:33,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-03 03:53:33,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:33,194 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 03:53:33,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-03 03:53:33,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-03 03:53:33,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 03:53:33,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:33,810 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:53:33,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:33,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2139335360, now seen corresponding path program 1 times [2022-11-03 03:53:33,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:53:33,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578704891] [2022-11-03 03:53:33,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:33,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:53:33,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:53:33,813 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:53:33,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-03 03:53:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:34,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 03:53:34,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:53:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:34,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:53:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:35,377 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:53:35,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578704891] [2022-11-03 03:53:35,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578704891] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:53:35,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [205513579] [2022-11-03 03:53:35,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:35,378 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:53:35,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:53:35,380 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:53:35,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-03 03:53:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:36,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 03:53:36,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:53:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:36,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:53:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:36,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [205513579] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:53:36,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338695953] [2022-11-03 03:53:36,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:36,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:36,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:53:36,483 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:53:36,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 03:53:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:36,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 03:53:36,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:53:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:37,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:53:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:38,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338695953] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:53:38,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 03:53:38,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13, 13] total 35 [2022-11-03 03:53:38,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85460067] [2022-11-03 03:53:38,234 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 03:53:38,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:53:38,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:53:38,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:53:38,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=808, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 03:53:38,236 INFO L87 Difference]: Start difference. First operand 1691 states and 1851 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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-03 03:53:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:43,307 INFO L93 Difference]: Finished difference Result 1740 states and 1919 transitions. [2022-11-03 03:53:43,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-03 03:53:43,308 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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 75 [2022-11-03 03:53:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:43,316 INFO L225 Difference]: With dead ends: 1740 [2022-11-03 03:53:43,316 INFO L226 Difference]: Without dead ends: 1724 [2022-11-03 03:53:43,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1371, Invalid=2789, Unknown=0, NotChecked=0, Total=4160 [2022-11-03 03:53:43,326 INFO L413 NwaCegarLoop]: 1639 mSDtfsCounter, 230 mSDsluCounter, 24467 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 26106 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:43,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 26106 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 03:53:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2022-11-03 03:53:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1708. [2022-11-03 03:53:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1010 states have (on average 1.8277227722772278) internal successors, (1846), 1698 states have internal predecessors, (1846), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 03:53:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 1870 transitions. [2022-11-03 03:53:43,385 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 1870 transitions. Word has length 75 [2022-11-03 03:53:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:43,386 INFO L495 AbstractCegarLoop]: Abstraction has 1708 states and 1870 transitions. [2022-11-03 03:53:43,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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-03 03:53:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 1870 transitions. [2022-11-03 03:53:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-03 03:53:43,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:43,387 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 03:53:43,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-03 03:53:43,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-03 03:53:43,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-03 03:53:43,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:43,995 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:53:43,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:43,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1664319297, now seen corresponding path program 2 times [2022-11-03 03:53:43,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:53:43,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319062343] [2022-11-03 03:53:43,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:53:43,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:53:43,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:53:43,998 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:53:44,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-03 03:53:44,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 03:53:44,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:53:44,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 03:53:44,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:53:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:45,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:53:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:50,026 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:53:50,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319062343] [2022-11-03 03:53:50,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319062343] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:53:50,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2048161022] [2022-11-03 03:53:50,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:53:50,027 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:53:50,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:53:50,030 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:53:50,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-03 03:53:52,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 03:53:52,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:53:52,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 03:53:52,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:53:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:52,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:53:54,185 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:54,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2048161022] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:53:54,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367799825] [2022-11-03 03:53:54,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:53:54,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:54,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:53:54,187 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:53:54,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-03 03:54:15,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 03:54:15,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:54:15,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 03:54:15,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:54:16,070 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:54:16,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 03:54:16,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:54:16,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:54:16,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:54:16,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:54:16,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 03:54:16,954 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2369) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2370 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2370)))) is different from true [2022-11-03 03:54:17,162 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2374))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2373)))) is different from true [2022-11-03 03:54:17,193 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2376)))) is different from true [2022-11-03 03:54:17,395 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 03:54:17,945 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2388))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2387) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 03:54:17,964 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2390 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2390))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2389)))) is different from true [2022-11-03 03:54:17,982 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-03 03:54:18,002 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394)))) is different from true [2022-11-03 03:54:18,201 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2397))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2398 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2398)))) is different from true [2022-11-03 03:54:18,388 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2402))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2401)))) is different from true [2022-11-03 03:54:18,406 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 03:54:18,423 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2405))) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406)))) is different from true [2022-11-03 03:54:18,667 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:54:18,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 03:54:18,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 03:54:18,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 03:54:18,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 03:54:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 174 not checked. [2022-11-03 03:54:19,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:54:20,225 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2452 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2451) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2451) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-03 03:54:20,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367799825] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:54:20,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 03:54:20,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24, 24, 21] total 66 [2022-11-03 03:54:20,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665778705] [2022-11-03 03:54:20,240 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 03:54:20,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-03 03:54:20,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:54:20,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-03 03:54:20,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=2473, Unknown=36, NotChecked=1560, Total=4692 [2022-11-03 03:54:20,244 INFO L87 Difference]: Start difference. First operand 1708 states and 1870 transitions. Second operand has 66 states, 65 states have (on average 2.8) internal successors, (182), 66 states have internal predecessors, (182), 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-03 03:54:55,028 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2388))) (exists ((v_ArrVal_2374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2374))) (exists ((v_ArrVal_2390 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2390))) (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (exists ((v_ArrVal_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_ArrVal_2402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2402))) (exists ((v_ArrVal_2397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2397))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2405))) (exists ((v_ArrVal_2398 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2398))) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406))) (exists ((v_ArrVal_2389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2389))) (exists ((v_ArrVal_2371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2371))) (exists ((v_ArrVal_2401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2401))) (exists ((v_ArrVal_2375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2376))) (exists ((v_ArrVal_2387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2372))) (exists ((v_ArrVal_2373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2373)))) is different from true [2022-11-03 03:56:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:58,488 INFO L93 Difference]: Finished difference Result 3471 states and 3868 transitions. [2022-11-03 03:56:58,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-11-03 03:56:58,488 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 2.8) internal successors, (182), 66 states have internal predecessors, (182), 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 86 [2022-11-03 03:56:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:58,495 INFO L225 Difference]: With dead ends: 3471 [2022-11-03 03:56:58,496 INFO L226 Difference]: Without dead ends: 3457 [2022-11-03 03:56:58,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 350 SyntacticMatches, 15 SemanticMatches, 160 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 5772 ImplicationChecksByTransitivity, 70.1s TimeCoverageRelationStatistics Valid=4713, Invalid=16917, Unknown=182, NotChecked=4270, Total=26082 [2022-11-03 03:56:58,503 INFO L413 NwaCegarLoop]: 1637 mSDtfsCounter, 3097 mSDsluCounter, 41637 mSDsCounter, 0 mSdLazyCounter, 36800 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3170 SdHoareTripleChecker+Valid, 43274 SdHoareTripleChecker+Invalid, 68781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 36800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31732 IncrementalHoareTripleChecker+Unchecked, 93.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:58,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3170 Valid, 43274 Invalid, 68781 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [249 Valid, 36800 Invalid, 0 Unknown, 31732 Unchecked, 93.6s Time] [2022-11-03 03:56:58,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2022-11-03 03:56:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 1786. [2022-11-03 03:56:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1088 states have (on average 1.7766544117647058) internal successors, (1933), 1775 states have internal predecessors, (1933), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 03:56:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 1957 transitions. [2022-11-03 03:56:58,554 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 1957 transitions. Word has length 86 [2022-11-03 03:56:58,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:58,555 INFO L495 AbstractCegarLoop]: Abstraction has 1786 states and 1957 transitions. [2022-11-03 03:56:58,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 2.8) internal successors, (182), 66 states have internal predecessors, (182), 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-03 03:56:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 1957 transitions. [2022-11-03 03:56:58,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-03 03:56:58,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:58,557 INFO L195 NwaCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 03:56:58,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:58,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:58,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:59,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 03:56:59,174 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:56:59,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:59,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1662654294, now seen corresponding path program 1 times [2022-11-03 03:56:59,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:56:59,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281911899] [2022-11-03 03:56:59,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:59,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:56:59,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:56:59,178 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:56:59,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-03 03:56:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:59,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 03:56:59,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:01,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:57:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:08,939 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:57:08,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281911899] [2022-11-03 03:57:08,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281911899] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:57:08,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1482328066] [2022-11-03 03:57:08,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:08,940 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:57:08,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:57:08,941 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:57:08,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-03 03:57:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:10,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 03:57:10,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:10,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:57:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:11,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1482328066] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:57:11,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115874394] [2022-11-03 03:57:11,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:11,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:11,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:57:11,774 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:57:11,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-03 03:57:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:12,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 03:57:12,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:12,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:57:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:25,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115874394] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:57:25,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 03:57:25,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45, 45, 45, 45] total 131 [2022-11-03 03:57:25,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339831834] [2022-11-03 03:57:25,515 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 03:57:25,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-11-03 03:57:25,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:57:25,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-11-03 03:57:25,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4083, Invalid=12947, Unknown=0, NotChecked=0, Total=17030 [2022-11-03 03:57:25,526 INFO L87 Difference]: Start difference. First operand 1786 states and 1957 transitions. Second operand has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 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-03 04:00:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:15,771 INFO L93 Difference]: Finished difference Result 1976 states and 2287 transitions. [2022-11-03 04:00:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-11-03 04:00:15,772 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 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 110 [2022-11-03 04:00:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:15,776 INFO L225 Difference]: With dead ends: 1976 [2022-11-03 04:00:15,777 INFO L226 Difference]: Without dead ends: 1968 [2022-11-03 04:00:15,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7406 ImplicationChecksByTransitivity, 167.1s TimeCoverageRelationStatistics Valid=18292, Invalid=46478, Unknown=0, NotChecked=0, Total=64770 [2022-11-03 04:00:15,784 INFO L413 NwaCegarLoop]: 1668 mSDtfsCounter, 1077 mSDsluCounter, 94180 mSDsCounter, 0 mSdLazyCounter, 10114 mSolverCounterSat, 1497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 95848 SdHoareTripleChecker+Invalid, 11611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1497 IncrementalHoareTripleChecker+Valid, 10114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:15,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 95848 Invalid, 11611 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1497 Valid, 10114 Invalid, 0 Unknown, 0 Unchecked, 20.8s Time] [2022-11-03 04:00:15,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2022-11-03 04:00:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1892. [2022-11-03 04:00:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1194 states have (on average 1.7261306532663316) internal successors, (2061), 1881 states have internal predecessors, (2061), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 04:00:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2085 transitions. [2022-11-03 04:00:15,825 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2085 transitions. Word has length 110 [2022-11-03 04:00:15,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:15,825 INFO L495 AbstractCegarLoop]: Abstraction has 1892 states and 2085 transitions. [2022-11-03 04:00:15,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 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-03 04:00:15,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2085 transitions. [2022-11-03 04:00:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-03 04:00:15,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:15,827 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:15,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:16,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-11-03 04:00:16,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:16,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:16,437 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 04:00:16,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash -484834313, now seen corresponding path program 2 times [2022-11-03 04:00:16,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:16,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906394359] [2022-11-03 04:00:16,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 04:00:16,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:16,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:16,440 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:16,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-03 04:00:17,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-03 04:00:17,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:17,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 04:00:17,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:17,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:17,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 04:00:17,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:17,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 04:00:17,566 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:00:17,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 04:00:17,806 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-03 04:00:17,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 36 [2022-11-03 04:00:17,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:17,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2022-11-03 04:00:18,026 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-03 04:00:18,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2022-11-03 04:00:18,070 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-03 04:00:18,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:18,071 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:18,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906394359] [2022-11-03 04:00:18,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906394359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:18,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:18,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 04:00:18,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675463612] [2022-11-03 04:00:18,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:18,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 04:00:18,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:18,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 04:00:18,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-03 04:00:18,073 INFO L87 Difference]: Start difference. First operand 1892 states and 2085 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 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-03 04:00:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:23,127 INFO L93 Difference]: Finished difference Result 2433 states and 2679 transitions. [2022-11-03 04:00:23,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:00:23,128 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 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 113 [2022-11-03 04:00:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:23,133 INFO L225 Difference]: With dead ends: 2433 [2022-11-03 04:00:23,133 INFO L226 Difference]: Without dead ends: 2433 [2022-11-03 04:00:23,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-03 04:00:23,134 INFO L413 NwaCegarLoop]: 1819 mSDtfsCounter, 1933 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 5009 SdHoareTripleChecker+Invalid, 3888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1931 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:23,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1933 Valid, 5009 Invalid, 3888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1955 Invalid, 0 Unknown, 1931 Unchecked, 5.0s Time] [2022-11-03 04:00:23,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2022-11-03 04:00:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 1891. [2022-11-03 04:00:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1194 states have (on average 1.7252931323283083) internal successors, (2060), 1880 states have internal predecessors, (2060), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 04:00:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2084 transitions. [2022-11-03 04:00:23,162 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2084 transitions. Word has length 113 [2022-11-03 04:00:23,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:23,162 INFO L495 AbstractCegarLoop]: Abstraction has 1891 states and 2084 transitions. [2022-11-03 04:00:23,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 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-03 04:00:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2084 transitions. [2022-11-03 04:00:23,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-03 04:00:23,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:23,164 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:23,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-11-03 04:00:23,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:23,377 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 04:00:23,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash -484834312, now seen corresponding path program 1 times [2022-11-03 04:00:23,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:23,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247535101] [2022-11-03 04:00:23,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:23,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:23,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:23,380 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:23,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-03 04:00:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:24,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-03 04:00:24,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:24,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:24,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 04:00:24,705 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:00:24,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 04:00:24,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:24,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:24,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 04:00:24,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 04:00:25,081 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:00:25,096 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:00:25,111 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:00:25,212 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228)))) is different from true [2022-11-03 04:00:25,228 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:00:25,326 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235))) (exists ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4236))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:00:25,342 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4238) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4237) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:00:25,403 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4242 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4242))) (exists ((v_ArrVal_4241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4241) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:00:25,418 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4243) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:00:25,516 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-11-03 04:00:25,574 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254)))) is different from true [2022-11-03 04:00:25,625 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4257))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4258) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:00:25,785 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:00:25,873 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4267 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4267))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:00:26,097 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4275))) (exists ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4276))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:00:26,113 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4277) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4278 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4278) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:00:26,166 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4282))) (exists ((v_ArrVal_4281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4281) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:00:26,180 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4283))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4284) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:00:26,193 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4285 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4285))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4286) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:00:26,207 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4288))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4287) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:00:26,220 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4290 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4290))) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:00:26,273 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4293) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:00:26,287 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:00:26,300 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298)))) is different from true [2022-11-03 04:00:26,348 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:00:26,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 04:00:26,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 04:00:26,491 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:00:26,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 04:00:26,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 04:00:26,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 04:00:26,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 04:00:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 780 not checked. [2022-11-03 04:00:26,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:26,782 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4300) |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~mem35#1.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-03 04:00:26,820 WARN L833 $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_4300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4299) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2022-11-03 04:00:27,773 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4391) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4392))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4391) .cse2 v_ArrVal_4300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4299) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-03 04:00:27,782 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:27,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247535101] [2022-11-03 04:00:27,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247535101] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:27,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [558185063] [2022-11-03 04:00:27,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:27,783 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:00:27,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:00:27,784 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:00:27,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-03 04:02:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:28,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-03 04:02:28,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:28,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:02:29,108 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:02:29,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 04:02:29,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 04:02:29,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:02:29,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:02:29,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 04:02:29,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 04:02:29,279 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4760)))) is different from true [2022-11-03 04:02:29,334 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:29,387 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:02:29,402 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:29,416 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771)))) is different from true [2022-11-03 04:02:29,434 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4773) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774)))) is different from true [2022-11-03 04:02:29,489 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4778)))) is different from true [2022-11-03 04:02:29,622 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4785) |c_#memory_$Pointer$.offset|)) (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_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:29,637 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4787))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4788) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:02:29,652 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4789))) (exists ((v_ArrVal_4790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4790))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:29,716 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4794))) (exists ((v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4793))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:29,728 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4795) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4796) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:29,740 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4798) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:29,827 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (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_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:29,839 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:29,894 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810))) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:29,940 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4813))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4814)))) is different from true [2022-11-03 04:02:29,953 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4816)))) is different from true [2022-11-03 04:02:29,966 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4818))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (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-03 04:02:30,015 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4821))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:30,029 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4824) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4823))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:30,041 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4825 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4825))) (exists ((v_ArrVal_4826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4826))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:30,053 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4828 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4828) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4827))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:30,143 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4833))) (exists ((v_ArrVal_4834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4834))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:30,157 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4836))) (exists ((v_ArrVal_4835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4835) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:30,203 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4839))) (exists ((v_ArrVal_4840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4840))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:30,247 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4843) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4844) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:02:30,325 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:02:30,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 04:02:30,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 04:02:30,413 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:02:30,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 04:02:30,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 04:02:30,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 04:02:30,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 04:02:30,463 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 136 trivial. 837 not checked. [2022-11-03 04:02:30,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:30,541 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4848 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4847 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-03 04:02:30,577 WARN L833 $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_4847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4848 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4847 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-03 04:02:31,455 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4939))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4940) .cse0 v_ArrVal_4847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4940) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4939) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-03 04:02:31,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [558185063] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:02:31,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341749067] [2022-11-03 04:02:31,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:31,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:31,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:31,471 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:31,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-03 04:02:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:32,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-03 04:02:32,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:32,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 04:02:32,323 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:02:32,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 04:02:32,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:02:32,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:02:32,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 04:02:32,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 04:02:32,466 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307)))) is different from true [2022-11-03 04:02:32,512 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:32,524 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313)))) is different from true [2022-11-03 04:02:32,539 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314)))) is different from true [2022-11-03 04:02:32,689 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322)))) is different from true [2022-11-03 04:02:32,738 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5326))) (exists ((v_ArrVal_5327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5327) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:32,783 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331))) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:32,866 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5337))) (exists ((v_ArrVal_5336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5336)))) is different from true [2022-11-03 04:02:32,880 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5338) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5339))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:32,893 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5340))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5341) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:02:32,941 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5345) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5344) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:32,956 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5347))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5346)))) is different from true [2022-11-03 04:02:33,035 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5353) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:02:33,052 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5354) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5355))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:33,099 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5358))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5359 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5359) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:02:33,120 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:33,170 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5364))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5365) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:02:33,220 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5369) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5368 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5368) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:02:33,231 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5371))) (exists ((v_ArrVal_5370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5370) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:33,276 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5374) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5375)))) is different from true [2022-11-03 04:02:33,288 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5377))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5376) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:02:33,336 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5381) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5380))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:33,348 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5382 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5382) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5383)))) is different from true [2022-11-03 04:02:33,428 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5388))) (exists ((v_ArrVal_5389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5389))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:33,440 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5391))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 04:02:33,522 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:02:33,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 04:02:33,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 04:02:33,605 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:02:33,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 04:02:33,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 04:02:33,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 04:02:33,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 04:02:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 800 not checked. [2022-11-03 04:02:33,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:33,725 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5395 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5395) |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~mem35#1.base| v_ArrVal_5394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-03 04:02:33,762 WARN L833 $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_5394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5395 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-03 04:02:34,662 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5486) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5487))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5486) .cse2 v_ArrVal_5395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-03 04:02:34,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341749067] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:02:34,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:02:34,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36, 35] total 86 [2022-11-03 04:02:34,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318577675] [2022-11-03 04:02:34,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:34,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-11-03 04:02:34,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:02:34,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-11-03 04:02:34,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=205, Unknown=92, NotChecked=9010, Total=9506 [2022-11-03 04:02:34,678 INFO L87 Difference]: Start difference. First operand 1891 states and 2084 transitions. Second operand has 87 states, 85 states have (on average 2.4705882352941178) internal successors, (210), 87 states have internal predecessors, (210), 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-03 04:02:35,308 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4275))) (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4293) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810))) (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4833))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331))) (exists ((v_ArrVal_4242 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4242))) (exists ((v_ArrVal_5374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5374) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352))) (exists ((v_ArrVal_4839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4839))) (exists ((v_ArrVal_4821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4821))) (exists ((v_ArrVal_5381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5381) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777))) (exists ((v_ArrVal_5345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5345) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5326))) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235))) (exists ((v_ArrVal_5344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5344) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5369) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4267 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4267))) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4257))) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4794))) (exists ((v_ArrVal_4840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4840))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822))) (exists ((v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5358))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (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_5388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5388))) (exists ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4236))) (exists ((v_ArrVal_5327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5327) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217))) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253))) (exists ((v_ArrVal_5389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5389))) (exists ((v_ArrVal_4241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4241) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4813))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4843) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809))) (exists ((v_ArrVal_4834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4834))) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4276))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263))) (exists ((v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4793))) (exists ((v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5364))) (exists ((v_ArrVal_5380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5380))) (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_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228))) (exists ((v_ArrVal_5337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5337))) (exists ((v_ArrVal_5359 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5359) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4814))) (exists ((v_ArrVal_4844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4844) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4778))) (exists ((v_ArrVal_5336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5336))) (exists ((v_ArrVal_4258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4258) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5365) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4282))) (exists ((v_ArrVal_5368 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5368) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4281) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5375))) (exists ((v_ArrVal_5353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254))) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322))) (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-11-03 04:02:35,337 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4275))) (exists ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4283))) (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4277) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5338) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4795) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4293) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810))) (exists ((v_ArrVal_5391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5391))) (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) (exists ((v_ArrVal_4230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4787))) (exists ((v_ArrVal_4833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4833))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331))) (exists ((v_ArrVal_4242 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4242))) (exists ((v_ArrVal_5374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5374) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5371))) (exists ((v_ArrVal_4785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352))) (exists ((v_ArrVal_4839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4839))) (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4278 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4278) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4821))) (exists ((v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5339))) (exists ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5381) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5354) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5347))) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777))) (exists ((v_ArrVal_5345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5345) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5326))) (exists ((v_ArrVal_4796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4796) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5377))) (exists ((v_ArrVal_5370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5370) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235))) (exists ((v_ArrVal_5344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5344) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5369) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4267 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4267))) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4257))) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4794))) (exists ((v_ArrVal_4840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4840))) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822))) (exists ((v_ArrVal_4836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4836))) (exists ((v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5358))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (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_5388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5388))) (exists ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4236))) (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4238) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5327) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217))) (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805))) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253))) (exists ((v_ArrVal_4824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4824) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5389))) (exists ((v_ArrVal_4823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4823))) (exists ((v_ArrVal_4241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4241) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4813))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4843) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4237) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809))) (exists ((v_ArrVal_4834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4834))) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4276))) (exists ((v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5355))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263))) (exists ((v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4793))) (exists ((v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5364))) (exists ((v_ArrVal_5380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5380))) (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_5382 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5382) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768))) (exists ((v_ArrVal_4835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4835) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228))) (exists ((v_ArrVal_5337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5337))) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313))) (exists ((v_ArrVal_5359 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5359) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4814))) (exists ((v_ArrVal_4844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4844) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4778))) (exists ((v_ArrVal_5336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5336))) (exists ((v_ArrVal_5383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5383))) (exists ((v_ArrVal_4243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4243) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4788) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4258) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5365) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4284) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4282))) (exists ((v_ArrVal_5368 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5368) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5376) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4816))) (exists ((v_ArrVal_4281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4281) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5375))) (exists ((v_ArrVal_5353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5346))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254))) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322))) (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-11-03 04:02:35,414 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297))) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298)))) is different from true [2022-11-03 04:02:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:58,496 INFO L93 Difference]: Finished difference Result 3528 states and 3823 transitions. [2022-11-03 04:02:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 04:02:58,497 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 85 states have (on average 2.4705882352941178) internal successors, (210), 87 states have internal predecessors, (210), 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 113 [2022-11-03 04:02:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:58,504 INFO L225 Difference]: With dead ends: 3528 [2022-11-03 04:02:58,504 INFO L226 Difference]: Without dead ends: 3528 [2022-11-03 04:02:58,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 201 SyntacticMatches, 62 SemanticMatches, 108 ConstructedPredicates, 88 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=270, Invalid=441, Unknown=103, NotChecked=11176, Total=11990 [2022-11-03 04:02:58,506 INFO L413 NwaCegarLoop]: 1623 mSDtfsCounter, 2636 mSDsluCounter, 7016 mSDsCounter, 0 mSdLazyCounter, 9320 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2651 SdHoareTripleChecker+Valid, 8639 SdHoareTripleChecker+Invalid, 220142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 9320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210777 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:58,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2651 Valid, 8639 Invalid, 220142 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 9320 Invalid, 0 Unknown, 210777 Unchecked, 22.6s Time] [2022-11-03 04:02:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2022-11-03 04:02:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 1890. [2022-11-03 04:02:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1194 states have (on average 1.7244556113902847) internal successors, (2059), 1879 states have internal predecessors, (2059), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 04:02:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2083 transitions. [2022-11-03 04:02:58,556 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2083 transitions. Word has length 113 [2022-11-03 04:02:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:58,556 INFO L495 AbstractCegarLoop]: Abstraction has 1890 states and 2083 transitions. [2022-11-03 04:02:58,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 85 states have (on average 2.4705882352941178) internal successors, (210), 87 states have internal predecessors, (210), 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-03 04:02:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2083 transitions. [2022-11-03 04:02:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-03 04:02:58,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:58,558 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:58,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:58,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:59,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:59,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 04:02:59,174 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 04:02:59,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:59,174 INFO L85 PathProgramCache]: Analyzing trace with hash 276276933, now seen corresponding path program 1 times [2022-11-03 04:02:59,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:02:59,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503068329] [2022-11-03 04:02:59,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:59,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:02:59,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:02:59,176 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:02:59,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-03 04:03:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:00,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-03 04:03:00,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:00,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:03:00,458 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:03:00,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:03:00,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:03:00,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-03 04:03:00,872 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_61 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (not (= v_arrayElimCell_61 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_61)) (_ bv0 1)))) (exists ((v_ArrVal_5872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5872)))) is different from true [2022-11-03 04:03:00,994 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_61 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (not (= v_arrayElimCell_61 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_61)) (_ bv0 1)))) (exists ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5876)))) is different from true [2022-11-03 04:03:01,678 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_61 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (not (= v_arrayElimCell_61 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_61)) (_ bv0 1)))) (exists ((v_ArrVal_5895 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5895)))) is different from true [2022-11-03 04:03:01,981 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_61 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (not (= v_arrayElimCell_61 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_61)) (_ bv0 1)))) (exists ((v_ArrVal_5903 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5903) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:03:02,213 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_61 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (not (= v_arrayElimCell_61 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_61)) (_ bv0 1)))) (exists ((v_ArrVal_5910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5910)))) is different from true [2022-11-03 04:03:02,281 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:03:02,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 04:03:02,389 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:03:02,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 04:03:02,483 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:03:02,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 04:03:02,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 04:03:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 741 trivial. 210 not checked. [2022-11-03 04:03:02,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:02,609 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5912) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-03 04:03:02,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5912) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-03 04:03:02,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5911 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5911))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5912)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-03 04:03:02,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5911 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5911))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5912)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-03 04:03:02,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5911 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5958))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5911)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5912)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-03 04:03:02,937 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:03:02,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503068329] [2022-11-03 04:03:02,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503068329] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:03:02,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1718837117] [2022-11-03 04:03:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:02,937 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:03:02,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:03:02,938 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:03:02,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17cc23be-8bfc-4bc1-941d-5ddc6720314c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-03 04:03:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:32,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-03 04:03:32,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:32,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:03:32,892 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:03:32,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:03:32,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:03:32,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:03:33,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 04:03:33,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 04:03:33,637 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (_ bv0 1)))) (exists ((v_ArrVal_6344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6344) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:03:33,736 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (_ bv0 1)))) (exists ((v_ArrVal_6346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6346)))) is different from true [2022-11-03 04:03:34,107 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (_ bv0 1)))) (exists ((v_ArrVal_6351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6351) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:03:36,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:03:37,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:37,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2022-11-03 04:03:37,243 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-03 04:03:37,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 04:03:37,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 04:03:37,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:37,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:37,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:37,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:37,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2022-11-03 04:03:37,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 04:03:37,633 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-03 04:03:37,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:40,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 273030 treesize of output 186672