./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh --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 6c366d24ef9ea71cc6362f44963cc0aaadef105bf25ae7c56112d839540c58b5 --- 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-2329fc7 [2022-12-14 15:29:37,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:29:37,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:29:37,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:29:37,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:29:37,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:29:37,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:29:37,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:29:37,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:29:37,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:29:37,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:29:37,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:29:37,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:29:37,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:29:37,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:29:37,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:29:37,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:29:37,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:29:37,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:29:37,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:29:37,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:29:37,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:29:37,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:29:37,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:29:37,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:29:37,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:29:37,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:29:37,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:29:37,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:29:37,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:29:37,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:29:37,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:29:37,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:29:37,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:29:37,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:29:37,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:29:37,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:29:37,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:29:37,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:29:37,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:29:37,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:29:37,282 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 15:29:37,302 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:29:37,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:29:37,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:29:37,303 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:29:37,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:29:37,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:29:37,304 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:29:37,304 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:29:37,315 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:29:37,315 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:29:37,315 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:29:37,316 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:29:37,316 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:29:37,316 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:29:37,316 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:29:37,316 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:29:37,317 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:29:37,317 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:29:37,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 15:29:37,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 15:29:37,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:29:37,318 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:29:37,318 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:29:37,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:29:37,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:29:37,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:29:37,319 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 15:29:37,319 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 15:29:37,320 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 15:29:37,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:29:37,320 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 15:29:37,320 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:29:37,320 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:29:37,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:29:37,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:29:37,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:29:37,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:29:37,321 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:29:37,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:29:37,322 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:29:37,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:29:37,322 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:29:37,322 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_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/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_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh 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 -> 6c366d24ef9ea71cc6362f44963cc0aaadef105bf25ae7c56112d839540c58b5 [2022-12-14 15:29:37,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:29:37,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:29:37,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:29:37,550 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:29:37,551 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:29:37,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i [2022-12-14 15:29:40,070 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:29:40,285 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:29:40,286 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i [2022-12-14 15:29:40,296 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/data/d2a6c853f/980a81e561254788a7e3007ce80f0ed8/FLAG0b6005726 [2022-12-14 15:29:40,643 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/data/d2a6c853f/980a81e561254788a7e3007ce80f0ed8 [2022-12-14 15:29:40,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:29:40,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:29:40,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:29:40,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:29:40,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:29:40,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:29:40" (1/1) ... [2022-12-14 15:29:40,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2a027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:40, skipping insertion in model container [2022-12-14 15:29:40,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:29:40" (1/1) ... [2022-12-14 15:29:40,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:29:40,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:29:41,014 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i[33021,33034] [2022-12-14 15:29:41,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:29:41,108 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-12-14 15:29:41,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@185a88e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:41, skipping insertion in model container [2022-12-14 15:29:41,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:29:41,108 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-14 15:29:41,110 INFO L158 Benchmark]: Toolchain (without parser) took 462.20ms. Allocated memory is still 144.7MB. Free memory was 106.3MB in the beginning and 84.7MB in the end (delta: 21.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-14 15:29:41,110 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:29:41,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.97ms. Allocated memory is still 144.7MB. Free memory was 106.3MB in the beginning and 85.1MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 15:29:41,111 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.14ms. Allocated memory is still 144.7MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.97ms. Allocated memory is still 144.7MB. Free memory was 106.3MB in the beginning and 85.1MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh --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 6c366d24ef9ea71cc6362f44963cc0aaadef105bf25ae7c56112d839540c58b5 --- 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-2329fc7 [2022-12-14 15:29:42,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:29:42,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:29:42,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:29:42,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:29:42,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:29:42,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:29:42,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:29:42,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:29:42,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:29:42,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:29:42,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:29:42,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:29:42,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:29:42,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:29:42,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:29:42,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:29:42,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:29:42,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:29:42,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:29:42,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:29:42,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:29:42,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:29:42,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:29:42,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:29:42,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:29:42,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:29:42,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:29:42,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:29:42,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:29:42,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:29:42,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:29:42,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:29:42,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:29:42,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:29:42,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:29:42,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:29:42,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:29:42,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:29:42,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:29:42,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:29:42,521 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 15:29:42,545 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:29:42,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:29:42,546 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:29:42,546 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:29:42,547 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:29:42,547 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:29:42,547 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:29:42,547 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:29:42,547 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:29:42,548 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:29:42,548 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:29:42,548 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:29:42,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 15:29:42,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 15:29:42,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:29:42,549 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:29:42,549 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:29:42,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:29:42,550 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:29:42,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:29:42,550 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 15:29:42,550 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 15:29:42,550 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 15:29:42,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:29:42,551 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 15:29:42,551 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 15:29:42,551 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 15:29:42,551 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:29:42,551 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:29:42,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:29:42,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 15:29:42,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:29:42,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:29:42,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:29:42,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:29:42,553 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 15:29:42,553 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 15:29:42,553 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:29:42,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 15:29:42,553 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_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/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_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh 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 -> 6c366d24ef9ea71cc6362f44963cc0aaadef105bf25ae7c56112d839540c58b5 [2022-12-14 15:29:42,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:29:42,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:29:42,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:29:42,795 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:29:42,796 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:29:42,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i [2022-12-14 15:29:45,480 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:29:45,714 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:29:45,714 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i [2022-12-14 15:29:45,728 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/data/f0d09c038/60eef5a9f74948ec95282461a4bf4c22/FLAGed7bf4549 [2022-12-14 15:29:45,741 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/data/f0d09c038/60eef5a9f74948ec95282461a4bf4c22 [2022-12-14 15:29:45,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:29:45,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:29:45,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:29:45,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:29:45,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:29:45,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:29:45" (1/1) ... [2022-12-14 15:29:45,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e3bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:45, skipping insertion in model container [2022-12-14 15:29:45,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:29:45" (1/1) ... [2022-12-14 15:29:45,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:29:45,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:29:46,091 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i[33021,33034] [2022-12-14 15:29:46,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:29:46,184 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-14 15:29:46,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:29:46,203 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i[33021,33034] [2022-12-14 15:29:46,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:29:46,252 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:29:46,268 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i[33021,33034] [2022-12-14 15:29:46,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:29:46,328 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:29:46,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:46 WrapperNode [2022-12-14 15:29:46,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:29:46,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:29:46,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:29:46,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:29:46,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:46" (1/1) ... [2022-12-14 15:29:46,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:46" (1/1) ... [2022-12-14 15:29:46,400 INFO L138 Inliner]: procedures = 180, calls = 448, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1465 [2022-12-14 15:29:46,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:29:46,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:29:46,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:29:46,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:29:46,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:46" (1/1) ... [2022-12-14 15:29:46,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:46" (1/1) ... [2022-12-14 15:29:46,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:46" (1/1) ... [2022-12-14 15:29:46,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:46" (1/1) ... [2022-12-14 15:29:46,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:46" (1/1) ... [2022-12-14 15:29:46,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:46" (1/1) ... [2022-12-14 15:29:46,462 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:46" (1/1) ... [2022-12-14 15:29:46,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:46" (1/1) ... [2022-12-14 15:29:46,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:29:46,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:29:46,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:29:46,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:29:46,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:46" (1/1) ... [2022-12-14 15:29:46,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:29:46,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:29:46,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:29:46,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:29:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-14 15:29:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 15:29:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 15:29:46,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 15:29:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-14 15:29:46,531 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-14 15:29:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 15:29:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:29:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 15:29:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 15:29:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 15:29:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:29:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 15:29:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 15:29:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:29:46,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:29:46,741 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:29:46,743 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:29:46,747 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-14 15:29:51,643 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:29:51,653 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:29:51,653 INFO L300 CfgBuilder]: Removed 77 assume(true) statements. [2022-12-14 15:29:51,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:29:51 BoogieIcfgContainer [2022-12-14 15:29:51,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:29:51,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:29:51,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:29:51,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:29:51,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:29:45" (1/3) ... [2022-12-14 15:29:51,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6362baed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:29:51, skipping insertion in model container [2022-12-14 15:29:51,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:29:46" (2/3) ... [2022-12-14 15:29:51,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6362baed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:29:51, skipping insertion in model container [2022-12-14 15:29:51,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:29:51" (3/3) ... [2022-12-14 15:29:51,661 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test4-3.i [2022-12-14 15:29:51,679 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:29:51,680 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 851 error locations. [2022-12-14 15:29:51,725 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:29:51,729 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;@e99760d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:29:51,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 851 error locations. [2022-12-14 15:29:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 1649 states, 785 states have (on average 2.2840764331210193) internal successors, (1793), 1640 states have internal predecessors, (1793), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:29:51,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 15:29:51,738 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:29:51,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 15:29:51,739 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:29:51,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:29:51,743 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-12-14 15:29:51,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:29:51,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167252716] [2022-12-14 15:29:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:29:51,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:29:51,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:29:51,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:29:51,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 15:29:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:29:51,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 15:29:51,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:29:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:29:51,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:29:51,906 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:29:51,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167252716] [2022-12-14 15:29:51,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167252716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:29:51,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:29:51,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:29:51,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624634398] [2022-12-14 15:29:51,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:29:51,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 15:29:51,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:29:51,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 15:29:51,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 15:29:51,936 INFO L87 Difference]: Start difference. First operand has 1649 states, 785 states have (on average 2.2840764331210193) internal successors, (1793), 1640 states have internal predecessors, (1793), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) 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-12-14 15:29:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:29:51,991 INFO L93 Difference]: Finished difference Result 1631 states and 1722 transitions. [2022-12-14 15:29:51,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 15:29:51,993 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-12-14 15:29:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:29:52,008 INFO L225 Difference]: With dead ends: 1631 [2022-12-14 15:29:52,009 INFO L226 Difference]: Without dead ends: 1629 [2022-12-14 15:29:52,010 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-12-14 15:29:52,012 INFO L413 NwaCegarLoop]: 1722 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, 1722 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-12-14 15:29:52,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:29:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-12-14 15:29:52,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2022-12-14 15:29:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 776 states have (on average 2.1752577319587627) internal successors, (1688), 1620 states have internal predecessors, (1688), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:29:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 1720 transitions. [2022-12-14 15:29:52,093 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 1720 transitions. Word has length 5 [2022-12-14 15:29:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:29:52,093 INFO L495 AbstractCegarLoop]: Abstraction has 1629 states and 1720 transitions. [2022-12-14 15:29:52,093 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-12-14 15:29:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 1720 transitions. [2022-12-14 15:29:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 15:29:52,094 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:29:52,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 15:29:52,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:29:52,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:29:52,296 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:29:52,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:29:52,298 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-12-14 15:29:52,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:29:52,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091222247] [2022-12-14 15:29:52,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:29:52,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:29:52,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:29:52,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:29:52,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 15:29:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:29:52,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:29:52,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:29:52,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 15:29:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:29:52,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:29:52,559 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:29:52,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091222247] [2022-12-14 15:29:52,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091222247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:29:52,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:29:52,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:29:52,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971453492] [2022-12-14 15:29:52,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:29:52,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:29:52,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:29:52,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:29:52,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:29:52,562 INFO L87 Difference]: Start difference. First operand 1629 states and 1720 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-12-14 15:29:54,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:29:54,869 INFO L93 Difference]: Finished difference Result 1666 states and 1770 transitions. [2022-12-14 15:29:54,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:29:54,870 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-12-14 15:29:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:29:54,878 INFO L225 Difference]: With dead ends: 1666 [2022-12-14 15:29:54,878 INFO L226 Difference]: Without dead ends: 1666 [2022-12-14 15:29:54,878 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-12-14 15:29:54,879 INFO L413 NwaCegarLoop]: 992 mSDtfsCounter, 1155 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:29:54,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1287 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-12-14 15:29:54,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2022-12-14 15:29:54,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1612. [2022-12-14 15:29:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 852 states have (on average 2.0305164319248825) internal successors, (1730), 1603 states have internal predecessors, (1730), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:29:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 1762 transitions. [2022-12-14 15:29:54,900 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 1762 transitions. Word has length 5 [2022-12-14 15:29:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:29:54,900 INFO L495 AbstractCegarLoop]: Abstraction has 1612 states and 1762 transitions. [2022-12-14 15:29:54,901 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-12-14 15:29:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1762 transitions. [2022-12-14 15:29:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 15:29:54,901 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:29:54,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 15:29:54,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 15:29:55,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:29:55,103 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:29:55,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:29:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-12-14 15:29:55,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:29:55,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791249119] [2022-12-14 15:29:55,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:29:55,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:29:55,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:29:55,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:29:55,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 15:29:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:29:55,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:29:55,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:29:55,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:29:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:29:55,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:29:55,262 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:29:55,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791249119] [2022-12-14 15:29:55,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791249119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:29:55,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:29:55,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:29:55,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920712948] [2022-12-14 15:29:55,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:29:55,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:29:55,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:29:55,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:29:55,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:29:55,264 INFO L87 Difference]: Start difference. First operand 1612 states and 1762 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-12-14 15:29:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:29:58,650 INFO L93 Difference]: Finished difference Result 1915 states and 2085 transitions. [2022-12-14 15:29:58,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:29:58,650 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-12-14 15:29:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:29:58,653 INFO L225 Difference]: With dead ends: 1915 [2022-12-14 15:29:58,654 INFO L226 Difference]: Without dead ends: 1915 [2022-12-14 15:29:58,654 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-12-14 15:29:58,654 INFO L413 NwaCegarLoop]: 1388 mSDtfsCounter, 504 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:29:58,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 2068 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-12-14 15:29:58,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2022-12-14 15:29:58,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1768. [2022-12-14 15:29:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1018 states have (on average 2.0) internal successors, (2036), 1759 states have internal predecessors, (2036), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:29:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2068 transitions. [2022-12-14 15:29:58,678 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2068 transitions. Word has length 5 [2022-12-14 15:29:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:29:58,678 INFO L495 AbstractCegarLoop]: Abstraction has 1768 states and 2068 transitions. [2022-12-14 15:29:58,678 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-12-14 15:29:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2068 transitions. [2022-12-14 15:29:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:29:58,678 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:29:58,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:29:58,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-14 15:29:58,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:29:58,879 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:29:58,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:29:58,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1157590079, now seen corresponding path program 1 times [2022-12-14 15:29:58,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:29:58,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308328118] [2022-12-14 15:29:58,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:29:58,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:29:58,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:29:58,881 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:29:58,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-14 15:29:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:29:58,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 15:29:58,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:29:58,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:29:58,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:29:58,969 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:29:58,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308328118] [2022-12-14 15:29:58,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308328118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:29:58,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:29:58,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:29:58,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610223331] [2022-12-14 15:29:58,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:29:58,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:29:58,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:29:58,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:29:58,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:29:58,971 INFO L87 Difference]: Start difference. First operand 1768 states and 2068 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-12-14 15:29:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:29:59,062 INFO L93 Difference]: Finished difference Result 3110 states and 3671 transitions. [2022-12-14 15:29:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:29:59,066 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-12-14 15:29:59,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:29:59,075 INFO L225 Difference]: With dead ends: 3110 [2022-12-14 15:29:59,076 INFO L226 Difference]: Without dead ends: 3110 [2022-12-14 15:29:59,076 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-12-14 15:29:59,077 INFO L413 NwaCegarLoop]: 1840 mSDtfsCounter, 1139 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:29:59,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 3451 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:29:59,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2022-12-14 15:29:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 1769. [2022-12-14 15:29:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1019 states have (on average 1.999018645731109) internal successors, (2037), 1760 states have internal predecessors, (2037), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:29:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2069 transitions. [2022-12-14 15:29:59,127 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2069 transitions. Word has length 6 [2022-12-14 15:29:59,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:29:59,128 INFO L495 AbstractCegarLoop]: Abstraction has 1769 states and 2069 transitions. [2022-12-14 15:29:59,128 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-12-14 15:29:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2069 transitions. [2022-12-14 15:29:59,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:29:59,128 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:29:59,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:29:59,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-14 15:29:59,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:29:59,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:29:59,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:29:59,332 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-12-14 15:29:59,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:29:59,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678542476] [2022-12-14 15:29:59,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:29:59,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:29:59,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:29:59,337 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:29:59,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-14 15:29:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:29:59,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 15:29:59,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:29:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:29:59,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:29:59,583 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:29:59,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678542476] [2022-12-14 15:29:59,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678542476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:29:59,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:29:59,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:29:59,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031987193] [2022-12-14 15:29:59,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:29:59,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:29:59,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:29:59,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:29:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:29:59,584 INFO L87 Difference]: Start difference. First operand 1769 states and 2069 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-12-14 15:29:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:29:59,614 INFO L93 Difference]: Finished difference Result 1733 states and 2032 transitions. [2022-12-14 15:29:59,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:29:59,614 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-12-14 15:29:59,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:29:59,617 INFO L225 Difference]: With dead ends: 1733 [2022-12-14 15:29:59,617 INFO L226 Difference]: Without dead ends: 1733 [2022-12-14 15:29:59,617 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-12-14 15:29:59,618 INFO L413 NwaCegarLoop]: 1569 mSDtfsCounter, 1529 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 1602 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-12-14 15:29:59,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 1602 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:29:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2022-12-14 15:29:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1727. [2022-12-14 15:29:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1001 states have (on average 1.992007992007992) internal successors, (1994), 1718 states have internal predecessors, (1994), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:29:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2026 transitions. [2022-12-14 15:29:59,656 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2026 transitions. Word has length 11 [2022-12-14 15:29:59,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:29:59,657 INFO L495 AbstractCegarLoop]: Abstraction has 1727 states and 2026 transitions. [2022-12-14 15:29:59,657 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-12-14 15:29:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2026 transitions. [2022-12-14 15:29:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:29:59,657 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:29:59,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:29:59,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-14 15:29:59,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:29:59,859 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:29:59,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:29:59,860 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-12-14 15:29:59,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:29:59,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733653715] [2022-12-14 15:29:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:29:59,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:29:59,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:29:59,865 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:29:59,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-14 15:30:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:00,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:30:00,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:00,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:30:00,050 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:30:00,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733653715] [2022-12-14 15:30:00,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733653715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:30:00,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:30:00,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:30:00,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402979963] [2022-12-14 15:30:00,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:30:00,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:30:00,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:30:00,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:30:00,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:30:00,051 INFO L87 Difference]: Start difference. First operand 1727 states and 2026 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-12-14 15:30:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:00,112 INFO L93 Difference]: Finished difference Result 1712 states and 2004 transitions. [2022-12-14 15:30:00,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:30:00,112 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-12-14 15:30:00,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:00,117 INFO L225 Difference]: With dead ends: 1712 [2022-12-14 15:30:00,117 INFO L226 Difference]: Without dead ends: 1712 [2022-12-14 15:30:00,118 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-12-14 15:30:00,118 INFO L413 NwaCegarLoop]: 1524 mSDtfsCounter, 1510 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:00,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 3074 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:30:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-12-14 15:30:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1705. [2022-12-14 15:30:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 993 states have (on average 1.9788519637462236) internal successors, (1965), 1696 states have internal predecessors, (1965), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:30:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 1997 transitions. [2022-12-14 15:30:00,148 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 1997 transitions. Word has length 13 [2022-12-14 15:30:00,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:00,148 INFO L495 AbstractCegarLoop]: Abstraction has 1705 states and 1997 transitions. [2022-12-14 15:30:00,149 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-12-14 15:30:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 1997 transitions. [2022-12-14 15:30:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 15:30:00,149 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:00,149 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-12-14 15:30:00,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-14 15:30:00,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:00,350 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:30:00,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:00,350 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-12-14 15:30:00,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:30:00,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304335875] [2022-12-14 15:30:00,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:00,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:00,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:30:00,352 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:30:00,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-14 15:30:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:00,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:30:00,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:00,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 15:30:00,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-12-14 15:30:00,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:30:00,538 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:30:00,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304335875] [2022-12-14 15:30:00,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304335875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:30:00,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:30:00,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:30:00,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260085361] [2022-12-14 15:30:00,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:30:00,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:30:00,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:30:00,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:30:00,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:30:00,540 INFO L87 Difference]: Start difference. First operand 1705 states and 1997 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-12-14 15:30:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:04,484 INFO L93 Difference]: Finished difference Result 2517 states and 2814 transitions. [2022-12-14 15:30:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:30:04,485 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-12-14 15:30:04,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:04,492 INFO L225 Difference]: With dead ends: 2517 [2022-12-14 15:30:04,492 INFO L226 Difference]: Without dead ends: 2517 [2022-12-14 15:30:04,492 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-12-14 15:30:04,493 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 2751 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2764 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:04,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2764 Valid, 1870 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-12-14 15:30:04,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2022-12-14 15:30:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 1701. [2022-12-14 15:30:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 993 states have (on average 1.9748237663645518) internal successors, (1961), 1692 states have internal predecessors, (1961), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:30:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 1993 transitions. [2022-12-14 15:30:04,514 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 1993 transitions. Word has length 27 [2022-12-14 15:30:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:04,514 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 1993 transitions. [2022-12-14 15:30:04,514 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-12-14 15:30:04,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 1993 transitions. [2022-12-14 15:30:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 15:30:04,515 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:04,515 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-12-14 15:30:04,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-14 15:30:04,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:04,715 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:30:04,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:04,716 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-12-14 15:30:04,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:30:04,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455439327] [2022-12-14 15:30:04,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:04,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:04,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:30:04,717 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:30:04,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-14 15:30:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:04,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 15:30:04,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:04,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:30:04,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:04,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:30:04,984 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:30:04,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455439327] [2022-12-14 15:30:04,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455439327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:30:04,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:30:04,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:30:04,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188544400] [2022-12-14 15:30:04,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:30:04,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:30:04,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:30:04,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:30:04,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:30:04,985 INFO L87 Difference]: Start difference. First operand 1701 states and 1993 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-12-14 15:30:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:09,685 INFO L93 Difference]: Finished difference Result 2262 states and 2463 transitions. [2022-12-14 15:30:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:30:09,686 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-12-14 15:30:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:09,689 INFO L225 Difference]: With dead ends: 2262 [2022-12-14 15:30:09,689 INFO L226 Difference]: Without dead ends: 2262 [2022-12-14 15:30:09,690 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-12-14 15:30:09,690 INFO L413 NwaCegarLoop]: 1160 mSDtfsCounter, 1247 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:09,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2524 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-12-14 15:30:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2022-12-14 15:30:09,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 1697. [2022-12-14 15:30:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 993 states have (on average 1.9707955689828802) internal successors, (1957), 1688 states have internal predecessors, (1957), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:30:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 1989 transitions. [2022-12-14 15:30:09,712 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 1989 transitions. Word has length 27 [2022-12-14 15:30:09,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:09,712 INFO L495 AbstractCegarLoop]: Abstraction has 1697 states and 1989 transitions. [2022-12-14 15:30:09,712 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-12-14 15:30:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 1989 transitions. [2022-12-14 15:30:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 15:30:09,713 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:09,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] [2022-12-14 15:30:09,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-14 15:30:09,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:09,914 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:30:09,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:09,914 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-12-14 15:30:09,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:30:09,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036580542] [2022-12-14 15:30:09,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:09,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:09,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:30:09,916 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:30:09,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-14 15:30:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:10,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:30:10,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:10,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:30:10,104 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:30:10,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036580542] [2022-12-14 15:30:10,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036580542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:30:10,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:30:10,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:30:10,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891688208] [2022-12-14 15:30:10,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:30:10,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:30:10,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:30:10,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:30:10,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:30:10,106 INFO L87 Difference]: Start difference. First operand 1697 states and 1989 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-12-14 15:30:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:10,145 INFO L93 Difference]: Finished difference Result 1697 states and 1985 transitions. [2022-12-14 15:30:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:30:10,146 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-12-14 15:30:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:10,149 INFO L225 Difference]: With dead ends: 1697 [2022-12-14 15:30:10,149 INFO L226 Difference]: Without dead ends: 1697 [2022-12-14 15:30:10,149 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-12-14 15:30:10,150 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 1479 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 3052 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:10,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 3052 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:30:10,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2022-12-14 15:30:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1691. [2022-12-14 15:30:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 987 states have (on average 1.972644376899696) internal successors, (1947), 1682 states have internal predecessors, (1947), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:30:10,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 1979 transitions. [2022-12-14 15:30:10,173 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 1979 transitions. Word has length 42 [2022-12-14 15:30:10,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:10,173 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 1979 transitions. [2022-12-14 15:30:10,173 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-12-14 15:30:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 1979 transitions. [2022-12-14 15:30:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 15:30:10,174 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:10,174 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-12-14 15:30:10,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-14 15:30:10,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:10,376 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:30:10,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:10,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-12-14 15:30:10,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:30:10,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342712386] [2022-12-14 15:30:10,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:10,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:10,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:30:10,382 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:30:10,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-14 15:30:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:10,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:30:10,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:10,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:30:10,869 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:30:10,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342712386] [2022-12-14 15:30:10,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342712386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:30:10,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:30:10,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:30:10,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642637214] [2022-12-14 15:30:10,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:30:10,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:30:10,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:30:10,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:30:10,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:30:10,870 INFO L87 Difference]: Start difference. First operand 1691 states and 1979 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-12-14 15:30:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:11,061 INFO L93 Difference]: Finished difference Result 2110 states and 2415 transitions. [2022-12-14 15:30:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:30:11,061 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-12-14 15:30:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:11,065 INFO L225 Difference]: With dead ends: 2110 [2022-12-14 15:30:11,065 INFO L226 Difference]: Without dead ends: 2110 [2022-12-14 15:30:11,065 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-12-14 15:30:11,065 INFO L413 NwaCegarLoop]: 1596 mSDtfsCounter, 455 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 2988 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:11,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 2988 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:30:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2022-12-14 15:30:11,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 1737. [2022-12-14 15:30:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1033 states have (on average 1.9293320425943852) internal successors, (1993), 1728 states have internal predecessors, (1993), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:30:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2025 transitions. [2022-12-14 15:30:11,086 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2025 transitions. Word has length 50 [2022-12-14 15:30:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:11,086 INFO L495 AbstractCegarLoop]: Abstraction has 1737 states and 2025 transitions. [2022-12-14 15:30:11,086 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-12-14 15:30:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2025 transitions. [2022-12-14 15:30:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 15:30:11,087 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:11,087 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-12-14 15:30:11,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-14 15:30:11,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:11,288 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:30:11,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:11,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-12-14 15:30:11,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:30:11,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024901095] [2022-12-14 15:30:11,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:11,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:11,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:30:11,290 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:30:11,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-14 15:30:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:11,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:30:11,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:11,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 15:30:11,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:30:11,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:30:11,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 15:30:11,907 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:30:11,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 15:30:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:11,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:30:11,925 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:30:11,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024901095] [2022-12-14 15:30:11,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024901095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:30:11,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:30:11,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:30:11,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885624172] [2022-12-14 15:30:11,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:30:11,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:30:11,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:30:11,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:30:11,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:30:11,927 INFO L87 Difference]: Start difference. First operand 1737 states and 2025 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-12-14 15:30:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:14,993 INFO L93 Difference]: Finished difference Result 1706 states and 1948 transitions. [2022-12-14 15:30:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:30:14,994 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-12-14 15:30:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:14,999 INFO L225 Difference]: With dead ends: 1706 [2022-12-14 15:30:14,999 INFO L226 Difference]: Without dead ends: 1706 [2022-12-14 15:30:14,999 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-12-14 15:30:15,000 INFO L413 NwaCegarLoop]: 744 mSDtfsCounter, 1047 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:15,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 1214 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-14 15:30:15,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2022-12-14 15:30:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1487. [2022-12-14 15:30:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 867 states have (on average 1.8362168396770473) internal successors, (1592), 1478 states have internal predecessors, (1592), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:30:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1624 transitions. [2022-12-14 15:30:15,013 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1624 transitions. Word has length 53 [2022-12-14 15:30:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:15,013 INFO L495 AbstractCegarLoop]: Abstraction has 1487 states and 1624 transitions. [2022-12-14 15:30:15,013 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-12-14 15:30:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1624 transitions. [2022-12-14 15:30:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 15:30:15,014 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:15,014 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-12-14 15:30:15,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-14 15:30:15,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:15,215 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:30:15,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:15,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-12-14 15:30:15,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:30:15,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883829616] [2022-12-14 15:30:15,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:15,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:15,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:30:15,223 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:30:15,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-14 15:30:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:15,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 15:30:15,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:15,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 15:30:15,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:30:15,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 15:30:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:15,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:30:15,452 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:30:15,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883829616] [2022-12-14 15:30:15,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883829616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:30:15,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:30:15,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:30:15,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239304415] [2022-12-14 15:30:15,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:30:15,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:30:15,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:30:15,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:30:15,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:30:15,454 INFO L87 Difference]: Start difference. First operand 1487 states and 1624 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-12-14 15:30:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:18,257 INFO L93 Difference]: Finished difference Result 1486 states and 1623 transitions. [2022-12-14 15:30:18,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:30:18,258 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-12-14 15:30:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:18,260 INFO L225 Difference]: With dead ends: 1486 [2022-12-14 15:30:18,260 INFO L226 Difference]: Without dead ends: 1486 [2022-12-14 15:30:18,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:30:18,261 INFO L413 NwaCegarLoop]: 1438 mSDtfsCounter, 4 mSDsluCounter, 2176 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3614 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:18,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3614 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-12-14 15:30:18,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2022-12-14 15:30:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2022-12-14 15:30:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 867 states have (on average 1.8350634371395618) internal successors, (1591), 1477 states have internal predecessors, (1591), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:30:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1623 transitions. [2022-12-14 15:30:18,274 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1623 transitions. Word has length 58 [2022-12-14 15:30:18,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:18,274 INFO L495 AbstractCegarLoop]: Abstraction has 1486 states and 1623 transitions. [2022-12-14 15:30:18,274 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-12-14 15:30:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1623 transitions. [2022-12-14 15:30:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 15:30:18,275 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:18,275 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-12-14 15:30:18,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-14 15:30:18,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:18,476 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:30:18,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:18,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-12-14 15:30:18,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:30:18,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470801686] [2022-12-14 15:30:18,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:18,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:18,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:30:18,482 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:30:18,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-14 15:30:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:18,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 15:30:18,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:18,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:30:18,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:30:18,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:30:18,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-12-14 15:30:18,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 15:30:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:18,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:30:18,810 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:30:18,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470801686] [2022-12-14 15:30:18,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470801686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:30:18,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:30:18,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:30:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150280231] [2022-12-14 15:30:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:30:18,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:30:18,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:30:18,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:30:18,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:30:18,812 INFO L87 Difference]: Start difference. First operand 1486 states and 1623 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-12-14 15:30:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:23,132 INFO L93 Difference]: Finished difference Result 1485 states and 1622 transitions. [2022-12-14 15:30:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:30:23,133 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-12-14 15:30:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:23,135 INFO L225 Difference]: With dead ends: 1485 [2022-12-14 15:30:23,135 INFO L226 Difference]: Without dead ends: 1485 [2022-12-14 15:30:23,135 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-12-14 15:30:23,136 INFO L413 NwaCegarLoop]: 1438 mSDtfsCounter, 2 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:23,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3665 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-12-14 15:30:23,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2022-12-14 15:30:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1485. [2022-12-14 15:30:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 866 states have (on average 1.836027713625866) internal successors, (1590), 1476 states have internal predecessors, (1590), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:30:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 1622 transitions. [2022-12-14 15:30:23,146 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 1622 transitions. Word has length 58 [2022-12-14 15:30:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:23,146 INFO L495 AbstractCegarLoop]: Abstraction has 1485 states and 1622 transitions. [2022-12-14 15:30:23,146 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-12-14 15:30:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1622 transitions. [2022-12-14 15:30:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 15:30:23,147 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:23,147 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-12-14 15:30:23,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-12-14 15:30:23,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:23,348 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:30:23,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:23,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1437209854, now seen corresponding path program 1 times [2022-12-14 15:30:23,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:30:23,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294864695] [2022-12-14 15:30:23,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:23,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:23,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:30:23,352 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:30:23,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-12-14 15:30:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:23,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:30:23,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:23,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:30:23,667 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:30:23,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294864695] [2022-12-14 15:30:23,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294864695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:30:23,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:30:23,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:30:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107034987] [2022-12-14 15:30:23,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:30:23,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:30:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:30:23,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:30:23,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:30:23,669 INFO L87 Difference]: Start difference. First operand 1485 states and 1622 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-12-14 15:30:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:23,733 INFO L93 Difference]: Finished difference Result 1488 states and 1627 transitions. [2022-12-14 15:30:23,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:30:23,733 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-12-14 15:30:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:23,736 INFO L225 Difference]: With dead ends: 1488 [2022-12-14 15:30:23,736 INFO L226 Difference]: Without dead ends: 1488 [2022-12-14 15:30:23,736 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-12-14 15:30:23,737 INFO L413 NwaCegarLoop]: 1437 mSDtfsCounter, 2 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4303 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:23,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4303 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:30:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-12-14 15:30:23,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2022-12-14 15:30:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 868 states have (on average 1.8352534562211982) internal successors, (1593), 1479 states have internal predecessors, (1593), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-14 15:30:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1627 transitions. [2022-12-14 15:30:23,749 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1627 transitions. Word has length 66 [2022-12-14 15:30:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:23,749 INFO L495 AbstractCegarLoop]: Abstraction has 1488 states and 1627 transitions. [2022-12-14 15:30:23,750 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-12-14 15:30:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1627 transitions. [2022-12-14 15:30:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 15:30:23,750 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:23,750 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-12-14 15:30:23,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-12-14 15:30:23,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:23,951 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:30:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:23,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1929088695, now seen corresponding path program 1 times [2022-12-14 15:30:23,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:30:23,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954783858] [2022-12-14 15:30:23,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:23,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:23,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:30:23,957 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:30:23,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-12-14 15:30:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:24,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:30:24,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:24,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:30:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:24,471 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:30:24,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954783858] [2022-12-14 15:30:24,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954783858] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:30:24,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1611559557] [2022-12-14 15:30:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:24,471 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:30:24,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:30:24,472 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:30:24,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-12-14 15:30:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:24,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:30:24,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:24,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:30:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:24,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1611559557] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:30:24,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138621753] [2022-12-14 15:30:24,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:24,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:30:24,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:30:24,833 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:30:24,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 15:30:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:25,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:30:25,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:25,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:30:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:25,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138621753] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:30:25,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:30:25,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-12-14 15:30:25,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163194027] [2022-12-14 15:30:25,084 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:30:25,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:30:25,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:30:25,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:30:25,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:30:25,086 INFO L87 Difference]: Start difference. First operand 1488 states and 1627 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-12-14 15:30:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:25,257 INFO L93 Difference]: Finished difference Result 1500 states and 1645 transitions. [2022-12-14 15:30:25,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 15:30:25,257 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-12-14 15:30:25,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:25,260 INFO L225 Difference]: With dead ends: 1500 [2022-12-14 15:30:25,260 INFO L226 Difference]: Without dead ends: 1500 [2022-12-14 15:30:25,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:30:25,261 INFO L413 NwaCegarLoop]: 1437 mSDtfsCounter, 12 mSDsluCounter, 4294 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5731 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:25,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5731 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:30:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2022-12-14 15:30:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1498. [2022-12-14 15:30:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 877 states have (on average 1.8335233751425313) internal successors, (1608), 1488 states have internal predecessors, (1608), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-14 15:30:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1642 transitions. [2022-12-14 15:30:25,279 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1642 transitions. Word has length 67 [2022-12-14 15:30:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:25,279 INFO L495 AbstractCegarLoop]: Abstraction has 1498 states and 1642 transitions. [2022-12-14 15:30:25,279 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-12-14 15:30:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1642 transitions. [2022-12-14 15:30:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-14 15:30:25,279 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:25,279 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-12-14 15:30:25,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 15:30:25,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-12-14 15:30:25,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-12-14 15:30:25,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 15:30:25,882 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:30:25,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:25,883 INFO L85 PathProgramCache]: Analyzing trace with hash -619234498, now seen corresponding path program 2 times [2022-12-14 15:30:25,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:30:25,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843741662] [2022-12-14 15:30:25,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 15:30:25,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:25,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:30:25,887 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:30:25,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-12-14 15:30:26,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 15:30:26,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:30:26,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 15:30:26,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:26,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:30:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:26,468 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:30:26,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843741662] [2022-12-14 15:30:26,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843741662] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:30:26,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [392730952] [2022-12-14 15:30:26,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 15:30:26,468 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:30:26,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:30:26,469 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:30:26,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-12-14 15:30:27,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 15:30:27,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:30:27,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 15:30:27,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:27,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:30:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:27,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [392730952] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:30:27,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570135443] [2022-12-14 15:30:27,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 15:30:27,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:30:27,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:30:27,462 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:30:27,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 15:30:35,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 15:30:35,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:30:35,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 15:30:35,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:35,910 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:30:35,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 15:30:35,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:30:36,265 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:30:36,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 15:30:36,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-14 15:30:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 15:30:36,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:30:36,476 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-12-14 15:30:36,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 15:30:36,483 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1261 (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_1261) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2022-12-14 15:30:36,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570135443] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:30:36,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 15:30:36,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-12-14 15:30:36,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672970189] [2022-12-14 15:30:36,485 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 15:30:36,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 15:30:36,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:30:36,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 15:30:36,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-12-14 15:30:36,487 INFO L87 Difference]: Start difference. First operand 1498 states and 1642 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-12-14 15:30:48,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:48,599 INFO L93 Difference]: Finished difference Result 1571 states and 1681 transitions. [2022-12-14 15:30:48,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 15:30:48,600 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-12-14 15:30:48,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:48,602 INFO L225 Difference]: With dead ends: 1571 [2022-12-14 15:30:48,602 INFO L226 Difference]: Without dead ends: 1567 [2022-12-14 15:30:48,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=475, Invalid=2692, Unknown=29, NotChecked=110, Total=3306 [2022-12-14 15:30:48,603 INFO L413 NwaCegarLoop]: 920 mSDtfsCounter, 2063 mSDsluCounter, 9940 mSDsCounter, 0 mSdLazyCounter, 7884 mSolverCounterSat, 91 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2073 SdHoareTripleChecker+Valid, 10860 SdHoareTripleChecker+Invalid, 7980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 7884 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:48,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2073 Valid, 10860 Invalid, 7980 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [91 Valid, 7884 Invalid, 5 Unknown, 0 Unchecked, 10.9s Time] [2022-12-14 15:30:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-12-14 15:30:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1506. [2022-12-14 15:30:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 886 states have (on average 1.827313769751693) internal successors, (1619), 1496 states have internal predecessors, (1619), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-14 15:30:48,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1653 transitions. [2022-12-14 15:30:48,615 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1653 transitions. Word has length 70 [2022-12-14 15:30:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:48,615 INFO L495 AbstractCegarLoop]: Abstraction has 1506 states and 1653 transitions. [2022-12-14 15:30:48,615 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-12-14 15:30:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1653 transitions. [2022-12-14 15:30:48,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 15:30:48,616 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:48,616 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:30:48,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2022-12-14 15:30:48,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-14 15:30:49,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-12-14 15:30:49,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:49,219 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:30:49,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:49,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1151162527, now seen corresponding path program 1 times [2022-12-14 15:30:49,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:30:49,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883430370] [2022-12-14 15:30:49,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:49,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:49,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:30:49,224 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:30:49,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-12-14 15:30:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:49,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 15:30:49,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:49,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:30:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:50,139 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:30:50,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883430370] [2022-12-14 15:30:50,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883430370] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:30:50,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1070927925] [2022-12-14 15:30:50,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:50,139 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:30:50,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:30:50,140 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:30:50,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-12-14 15:30:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:50,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 15:30:50,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:50,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:30:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:50,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1070927925] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:30:50,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469990352] [2022-12-14 15:30:50,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:50,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:30:50,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:30:50,819 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:30:50,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 15:30:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:51,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 15:30:51,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:51,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:30:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:51,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469990352] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:30:51,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:30:51,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-12-14 15:30:51,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216303463] [2022-12-14 15:30:51,994 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:30:51,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 15:30:51,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:30:51,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 15:30:51,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 15:30:51,996 INFO L87 Difference]: Start difference. First operand 1506 states and 1653 transitions. Second operand has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 15:30:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:54,937 INFO L93 Difference]: Finished difference Result 1548 states and 1719 transitions. [2022-12-14 15:30:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-14 15:30:54,938 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2022-12-14 15:30:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:54,940 INFO L225 Difference]: With dead ends: 1548 [2022-12-14 15:30:54,940 INFO L226 Difference]: Without dead ends: 1542 [2022-12-14 15:30:54,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2022-12-14 15:30:54,941 INFO L413 NwaCegarLoop]: 1443 mSDtfsCounter, 63 mSDsluCounter, 18693 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 20136 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:54,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 20136 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 15:30:54,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2022-12-14 15:30:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1524. [2022-12-14 15:30:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 904 states have (on average 1.8163716814159292) internal successors, (1642), 1514 states have internal predecessors, (1642), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-14 15:30:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1676 transitions. [2022-12-14 15:30:54,953 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1676 transitions. Word has length 76 [2022-12-14 15:30:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:54,954 INFO L495 AbstractCegarLoop]: Abstraction has 1524 states and 1676 transitions. [2022-12-14 15:30:54,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 15:30:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1676 transitions. [2022-12-14 15:30:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-14 15:30:54,954 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:54,955 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:30:54,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 15:30:55,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2022-12-14 15:30:55,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-12-14 15:30:55,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:55,557 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:30:55,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:55,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1981086559, now seen corresponding path program 2 times [2022-12-14 15:30:55,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:30:55,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042645390] [2022-12-14 15:30:55,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 15:30:55,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:30:55,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:30:55,560 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:30:55,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-12-14 15:30:56,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 15:30:56,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:30:56,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 15:30:56,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:56,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:30:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:59,695 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:30:59,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042645390] [2022-12-14 15:30:59,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042645390] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:30:59,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [83045112] [2022-12-14 15:30:59,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 15:30:59,696 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:30:59,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:30:59,697 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:30:59,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-12-14 15:31:00,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 15:31:00,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:31:00,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 15:31:00,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:31:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:31:01,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:31:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:31:01,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [83045112] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:31:01,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597623109] [2022-12-14 15:31:01,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 15:31:01,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:31:01,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:31:01,856 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:31:01,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 15:31:07,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 15:31:07,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:31:07,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 15:31:07,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:31:07,297 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:31:07,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 15:31:07,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:31:07,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:31:07,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:31:07,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 15:31:07,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 15:31:07,871 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |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$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2373)))) is different from true [2022-12-14 15:31:07,880 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_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-12-14 15:31:07,984 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:31:08,083 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2384) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2383)))) is different from true [2022-12-14 15:31:08,092 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386)))) is different from true [2022-12-14 15:31:08,101 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2388) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2387) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-12-14 15:31:08,110 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2389))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2390) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 15:31:08,389 WARN L859 $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-12-14 15:31:08,515 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |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$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2401)))) is different from true [2022-12-14 15:31:08,640 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-12-14 15:31:08,648 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2408) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2407)))) is different from true [2022-12-14 15:31:08,863 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2414) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2413)))) is different from true [2022-12-14 15:31:08,899 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:31:08,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:31:08,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 15:31:09,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 15:31:09,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 15:31:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 198 not checked. [2022-12-14 15:31:09,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:31:09,846 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2022-12-14 15:31:09,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597623109] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:31:09,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 15:31:09,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 21] total 70 [2022-12-14 15:31:09,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186594178] [2022-12-14 15:31:09,852 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 15:31:09,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-12-14 15:31:09,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:31:09,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-12-14 15:31:09,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=2833, Unknown=37, NotChecked=1664, Total=5256 [2022-12-14 15:31:09,855 INFO L87 Difference]: Start difference. First operand 1524 states and 1676 transitions. Second operand has 70 states, 69 states have (on average 2.710144927536232) internal successors, (187), 70 states have internal predecessors, (187), 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-12-14 15:31:21,748 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))) (exists ((v_ArrVal_2414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2414) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2413))) (exists ((v_ArrVal_2372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2372))) (exists ((v_ArrVal_2371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2371)))) is different from true [2022-12-14 15:31:50,436 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2388) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2389))) (exists ((v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406))) (exists ((v_ArrVal_2414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2414) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2374))) (exists ((v_ArrVal_2387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2387) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2384) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2408) |c_#memory_$Pointer$.offset|)) (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_ArrVal_2402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |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_2413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2413))) (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_2401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2401))) (exists ((v_ArrVal_2372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2372))) (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_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385) |c_#memory_$Pointer$.offset|)) (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_2390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2390) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2383))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386))) (exists ((v_ArrVal_2371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2371))) (exists ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2407))) (exists ((v_ArrVal_2373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2373)))) is different from true [2022-12-14 15:32:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:32:46,125 INFO L93 Difference]: Finished difference Result 2694 states and 3014 transitions. [2022-12-14 15:32:46,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-12-14 15:32:46,125 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 2.710144927536232) internal successors, (187), 70 states have internal predecessors, (187), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 88 [2022-12-14 15:32:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:32:46,129 INFO L225 Difference]: With dead ends: 2694 [2022-12-14 15:32:46,129 INFO L226 Difference]: Without dead ends: 2676 [2022-12-14 15:32:46,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 350 SyntacticMatches, 21 SemanticMatches, 181 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 7376 ImplicationChecksByTransitivity, 58.3s TimeCoverageRelationStatistics Valid=5907, Invalid=21339, Unknown=870, NotChecked=5190, Total=33306 [2022-12-14 15:32:46,134 INFO L413 NwaCegarLoop]: 943 mSDtfsCounter, 3044 mSDsluCounter, 26887 mSDsCounter, 0 mSdLazyCounter, 24460 mSolverCounterSat, 259 mSolverCounterUnsat, 1116 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3123 SdHoareTripleChecker+Valid, 27830 SdHoareTripleChecker+Invalid, 46081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 24460 IncrementalHoareTripleChecker+Invalid, 1116 IncrementalHoareTripleChecker+Unknown, 20246 IncrementalHoareTripleChecker+Unchecked, 42.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:32:46,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3123 Valid, 27830 Invalid, 46081 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [259 Valid, 24460 Invalid, 1116 Unknown, 20246 Unchecked, 42.1s Time] [2022-12-14 15:32:46,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2022-12-14 15:32:46,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1610. [2022-12-14 15:32:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 990 states have (on average 1.7585858585858587) internal successors, (1741), 1599 states have internal predecessors, (1741), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-14 15:32:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1775 transitions. [2022-12-14 15:32:46,158 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1775 transitions. Word has length 88 [2022-12-14 15:32:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:32:46,158 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 1775 transitions. [2022-12-14 15:32:46,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 2.710144927536232) internal successors, (187), 70 states have internal predecessors, (187), 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-12-14 15:32:46,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1775 transitions. [2022-12-14 15:32:46,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 15:32:46,159 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:32:46,159 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-12-14 15:32:46,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-12-14 15:32:46,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-12-14 15:32:46,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 15:32:46,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:32:46,760 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:32:46,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:32:46,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1867051913, now seen corresponding path program 1 times [2022-12-14 15:32:46,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:32:46,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969253737] [2022-12-14 15:32:46,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:32:46,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:32:46,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:32:46,765 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:32:46,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-12-14 15:32:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:32:47,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 15:32:47,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:32:47,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 15:32:47,652 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 15:32:47,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-14 15:32:47,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:32:47,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 15:32:47,834 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2826) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:32:48,151 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2839)))) is different from true [2022-12-14 15:32:48,681 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2861) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:32:48,882 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:32:48,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 15:32:48,960 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:32:48,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 15:32:48,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-14 15:32:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-12-14 15:32:49,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:32:49,162 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2869 (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_2869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 15:32:49,375 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2869 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2915))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2869)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 15:32:49,377 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:32:49,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969253737] [2022-12-14 15:32:49,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969253737] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:32:49,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1955455612] [2022-12-14 15:32:49,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:32:49,377 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:32:49,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:32:49,378 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:32:49,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-12-14 15:32:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:32:52,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 15:32:52,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:32:52,544 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 15:32:52,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 15:32:52,718 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-12-14 15:32:52,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-12-14 15:32:52,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-12-14 15:32:52,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-12-14 15:32:55,175 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:32:55,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:32:55,341 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:32:55,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:32:55,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-12-14 15:32:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-12-14 15:32:55,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:32:55,432 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3322) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2022-12-14 15:32:55,442 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-14 15:32:55,638 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3368))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3322)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 15:32:55,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1955455612] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:32:55,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048666958] [2022-12-14 15:32:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:32:55,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:32:55,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:32:55,641 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:32:55,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 15:32:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:32:56,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 15:32:56,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:32:56,144 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:32:56,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 15:32:56,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:32:58,141 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:32:58,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 15:32:58,266 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:32:58,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 15:32:58,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-14 15:32:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-12-14 15:32:58,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:33:00,549 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-12-14 15:33:00,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-12-14 15:33:00,558 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3819))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2869)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2022-12-14 15:33:00,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048666958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:33:00,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:33:00,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 12] total 31 [2022-12-14 15:33:00,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357636266] [2022-12-14 15:33:00,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:33:00,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 15:33:00,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:33:00,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 15:33:00,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=770, Unknown=46, NotChecked=594, Total=1560 [2022-12-14 15:33:00,561 INFO L87 Difference]: Start difference. First operand 1610 states and 1775 transitions. Second operand has 32 states, 28 states have (on average 6.678571428571429) internal successors, (187), 31 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 15:33:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:33:31,918 INFO L93 Difference]: Finished difference Result 3010 states and 3234 transitions. [2022-12-14 15:33:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 15:33:31,919 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 6.678571428571429) internal successors, (187), 31 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 113 [2022-12-14 15:33:31,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:33:31,922 INFO L225 Difference]: With dead ends: 3010 [2022-12-14 15:33:31,922 INFO L226 Difference]: Without dead ends: 3010 [2022-12-14 15:33:31,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 190 SyntacticMatches, 131 SemanticMatches, 61 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2508 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=396, Invalid=2417, Unknown=85, NotChecked=1008, Total=3906 [2022-12-14 15:33:31,923 INFO L413 NwaCegarLoop]: 910 mSDtfsCounter, 4691 mSDsluCounter, 12299 mSDsCounter, 0 mSdLazyCounter, 13564 mSolverCounterSat, 125 mSolverCounterUnsat, 2597 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4711 SdHoareTripleChecker+Valid, 13209 SdHoareTripleChecker+Invalid, 23939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 13564 IncrementalHoareTripleChecker+Invalid, 2597 IncrementalHoareTripleChecker+Unknown, 7653 IncrementalHoareTripleChecker+Unchecked, 30.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:33:31,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4711 Valid, 13209 Invalid, 23939 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [125 Valid, 13564 Invalid, 2597 Unknown, 7653 Unchecked, 30.1s Time] [2022-12-14 15:33:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2022-12-14 15:33:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 1609. [2022-12-14 15:33:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 990 states have (on average 1.7575757575757576) internal successors, (1740), 1598 states have internal predecessors, (1740), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-14 15:33:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 1774 transitions. [2022-12-14 15:33:31,944 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 1774 transitions. Word has length 113 [2022-12-14 15:33:31,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:33:31,944 INFO L495 AbstractCegarLoop]: Abstraction has 1609 states and 1774 transitions. [2022-12-14 15:33:31,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 6.678571428571429) internal successors, (187), 31 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 15:33:31,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1774 transitions. [2022-12-14 15:33:31,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 15:33:31,945 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:33:31,945 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-12-14 15:33:31,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2022-12-14 15:33:32,164 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-14 15:33:32,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-12-14 15:33:32,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:33:32,547 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-12-14 15:33:32,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:33:32,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1867051912, now seen corresponding path program 1 times [2022-12-14 15:33:32,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:33:32,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825041788] [2022-12-14 15:33:32,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:33:32,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:33:32,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:33:32,553 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 15:33:32,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-12-14 15:33:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:33:33,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-14 15:33:33,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:33:33,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 15:33:33,475 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:33:33,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 15:33:33,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:33:33,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:33:33,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:33:33,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 15:33:33,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 15:33:33,676 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186)))) is different from true [2022-12-14 15:33:33,686 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:33:33,721 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192))) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193)))) is different from true [2022-12-14 15:33:33,756 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:33:33,766 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4199))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4198)))) is different from true [2022-12-14 15:33:33,775 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4200))) (exists ((v_ArrVal_4201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4201)))) is different from true [2022-12-14 15:33:33,785 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203)))) is different from true [2022-12-14 15:33:33,795 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205))) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204)))) is different from true [2022-12-14 15:33:33,805 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4206) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4207) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:33:33,821 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209))) (exists ((v_ArrVal_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208)))) is different from true [2022-12-14 15:33:33,831 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4210))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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|))) is different from true [2022-12-14 15:33:33,841 WARN L859 $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_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213)))) is different from true [2022-12-14 15:33:33,851 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215)))) is different from true [2022-12-14 15:33:33,860 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:33:33,869 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218)))) is different from true [2022-12-14 15:33:33,878 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220)))) is different from true [2022-12-14 15:33:33,888 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223)))) is different from true [2022-12-14 15:33:33,897 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225)))) is different from true [2022-12-14 15:33:33,910 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:33:33,919 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229) |c_#memory_$Pointer$.base|)) (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-12-14 15:33:33,928 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231)))) is different from true [2022-12-14 15:33:33,938 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233)))) is different from true [2022-12-14 15:33:33,949 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234)))) is different from true [2022-12-14 15:33:33,958 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4236))) (exists ((v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4237)))) is different from true [2022-12-14 15:33:33,967 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4239))) (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|))) is different from true [2022-12-14 15:33:33,977 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4240))) (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|))) is different from true [2022-12-14 15:33:33,986 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4242 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4242))) (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-12-14 15:33:33,997 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4245))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:33:34,006 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4246))) (exists ((v_ArrVal_4247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4247)))) is different from true [2022-12-14 15:33:34,016 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249))) (exists ((v_ArrVal_4248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4248)))) is different from true [2022-12-14 15:33:34,028 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251))) (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|))) is different from true [2022-12-14 15:33:34,038 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 15:33:34,047 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254)))) is different from true [2022-12-14 15:33:34,056 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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)))) is different from true [2022-12-14 15:33:34,068 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4258) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:33:34,078 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 15:33:34,087 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4262)))) is different from true [2022-12-14 15:33:34,096 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4265)))) is different from true [2022-12-14 15:33:34,106 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4266) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4267 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4267)))) is different from true [2022-12-14 15:33:34,115 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268)))) is different from true [2022-12-14 15:33:34,124 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4271))) (exists ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4270) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:33:34,156 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:33:34,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:33:34,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 15:33:34,257 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:33:34,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:33:34,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 15:33:34,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 15:33:34,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 15:33:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2022-12-14 15:33:34,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:33:34,493 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (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_4272) |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_4273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-12-14 15:33:34,526 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-14 15:33:35,255 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4364))) (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_4365) .cse0 v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4364 (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_4365) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-12-14 15:33:35,263 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:33:35,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825041788] [2022-12-14 15:33:35,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825041788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:33:35,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [753893318] [2022-12-14 15:33:35,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:33:35,263 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:33:35,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:33:35,264 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:33:35,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-12-14 15:35:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:36,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 113 conjunts are in the unsatisfiable core [2022-12-14 15:35:36,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:35:36,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 15:35:36,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:35:36,218 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:35:36,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 15:35:36,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:35:36,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:35:36,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 15:35:36,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 15:35:36,322 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 15:35:36,358 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:35:36,367 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736))) (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:35:36,407 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740)))) is different from true [2022-12-14 15:35:36,417 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4743) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742)))) is different from true [2022-12-14 15:35:36,427 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745))) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744)))) is different from true [2022-12-14 15:35:36,441 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747)))) is different from true [2022-12-14 15:35:36,450 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4748 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749)))) is different from true [2022-12-14 15:35:36,459 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4751))) (exists ((v_ArrVal_4750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4750) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 15:35:36,468 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753)))) is different from true [2022-12-14 15:35:36,478 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4754) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4755) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:35:36,488 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:35:36,499 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758))) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:35:36,510 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4761 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4761) |c_#memory_$Pointer$.offset|)) (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-12-14 15:35:36,520 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:35:36,534 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765))) (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764)))) is different from true [2022-12-14 15:35:36,543 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766)))) is different from true [2022-12-14 15:35:36,553 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (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)))) is different from true [2022-12-14 15:35:36,563 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771)))) is different from true [2022-12-14 15:35:36,573 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:35:36,584 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775))) (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-12-14 15:35:36,595 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777)))) is different from true [2022-12-14 15:35:36,605 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4779))) (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-12-14 15:35:36,614 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4780)))) is different from true [2022-12-14 15:35:36,623 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4783))) (exists ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4782)))) is different from true [2022-12-14 15:35:36,633 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_4784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4784)))) is different from true [2022-12-14 15:35:36,642 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_4787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4787)))) is different from true [2022-12-14 15:35:36,650 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4789) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4788) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:35:36,662 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4791) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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)))) is different from true [2022-12-14 15:35:36,670 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4792))) (exists ((v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4793)))) is different from true [2022-12-14 15:35:36,680 WARN L859 $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_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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)))) is different from true [2022-12-14 15:35:36,688 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-12-14 15:35:36,698 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_4799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4799)))) is different from true [2022-12-14 15:35:36,708 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((v_ArrVal_4801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4801) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:35:36,717 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4802))) (exists ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803)))) is different from true [2022-12-14 15:35:36,727 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_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)))) is different from true [2022-12-14 15:35:36,736 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4807) |c_#memory_$Pointer$.base|)) (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|))) is different from true [2022-12-14 15:35:36,745 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4808 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4808) |c_#memory_$Pointer$.offset|)) (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)))) is different from true [2022-12-14 15:35:36,754 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4811)))) is different from true [2022-12-14 15:35:36,763 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4812) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4813)))) is different from true [2022-12-14 15:35:36,771 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815) |c_#memory_$Pointer$.offset|)) (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-12-14 15:35:36,780 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_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-12-14 15:35:36,811 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:35:36,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:35:36,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 15:35:36,888 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:35:36,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:35:36,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 15:35:36,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 15:35:36,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 15:35:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 987 not checked. [2022-12-14 15:35:36,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:35:36,991 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4819 (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_4818) |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_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-12-14 15:35:37,026 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-14 15:35:37,712 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4911))) (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_4910) .cse0 v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4818 (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_4910) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4911) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-12-14 15:35:37,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [753893318] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:37,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380150501] [2022-12-14 15:35:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:37,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:37,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:35:37,721 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:35:37,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f98348b4-485a-44a4-bc30-59769d1d2866/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 15:35:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:38,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-14 15:35:38,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:35:38,241 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:35:38,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 15:35:38,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:35:38,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:35:38,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:35:38,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 15:35:38,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 15:35:38,383 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_ArrVal_5278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5278)))) is different from true [2022-12-14 15:35:38,392 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5279))) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280)))) is different from true [2022-12-14 15:35:38,400 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282)))) is different from true [2022-12-14 15:35:38,410 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284))) (exists ((v_ArrVal_5283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5283)))) is different from true [2022-12-14 15:35:38,418 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5286))) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285)))) is different from true [2022-12-14 15:35:38,429 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5288))) (exists ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5287) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:35:38,438 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289))) (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 15:35:38,446 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291)))) is different from true [2022-12-14 15:35:38,455 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293)))) is different from true [2022-12-14 15:35:38,469 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5296))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5295)))) is different from true [2022-12-14 15:35:38,478 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297)))) is different from true [2022-12-14 15:35:38,485 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5300) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299)))) is different from true [2022-12-14 15:35:38,494 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5301))) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302)))) is different from true [2022-12-14 15:35:38,503 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303))) (exists ((v_ArrVal_5304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5304) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:35:38,513 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5305 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5305))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32)))) is different from true [2022-12-14 15:35:38,522 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.base|)) (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-12-14 15:35:38,531 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309)))) is different from true [2022-12-14 15:35:38,539 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:35:38,551 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314))) (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-12-14 15:35:38,561 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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|))) is different from true [2022-12-14 15:35:38,573 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:35:38,584 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320)))) is different from true [2022-12-14 15:35:38,595 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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-12-14 15:35:38,606 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 15:35:38,617 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5326)))) is different from true [2022-12-14 15:35:38,628 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (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|))) is different from true [2022-12-14 15:35:38,638 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330)))) is different from true [2022-12-14 15:35:38,649 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5332))) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 15:35:38,659 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5334) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5333)))) is different from true [2022-12-14 15:35:38,672 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5335)))) is different from true [2022-12-14 15:35:38,682 WARN L859 $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_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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)))) is different from true [2022-12-14 15:35:38,693 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5339) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5340)))) is different from true [2022-12-14 15:35:38,702 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5341))) (exists ((v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5342)))) is different from true [2022-12-14 15:35:38,711 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5344))) (exists ((v_ArrVal_5343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5343)))) is different from true [2022-12-14 15:35:38,722 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_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-12-14 15:35:38,733 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348)))) is different from true [2022-12-14 15:35:38,744 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5349))) (exists ((v_ArrVal_5350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5350)))) is different from true [2022-12-14 15:35:38,753 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5351))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352)))) is different from true [2022-12-14 15:35:38,762 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5354)))) is different from true [2022-12-14 15:35:38,771 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5355))) (exists ((v_ArrVal_5356 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5356)))) is different from true [2022-12-14 15:35:38,782 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5357) |c_#memory_$Pointer$.base|)) (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)))) is different from true [2022-12-14 15:35:38,794 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360)))) is different from true [2022-12-14 15:35:38,805 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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_5362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5362)))) is different from true [2022-12-14 15:35:38,845 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:35:38,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:35:38,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 15:35:38,906 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:35:38,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:35:38,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 15:35:38,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 15:35:38,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 15:35:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-12-14 15:35:38,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:35:38,996 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5364 (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_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 15:35:39,029 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-12-14 15:35:39,795 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5456))) (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_5455) .cse0 v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5363 (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_5455) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-12-14 15:35:39,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380150501] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:39,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:35:39,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 51, 53] total 136 [2022-12-14 15:35:39,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714663796] [2022-12-14 15:35:39,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:35:39,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 137 states [2022-12-14 15:35:39,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:35:39,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2022-12-14 15:35:39,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=255, Unknown=142, NotChecked=21060, Total=21756 [2022-12-14 15:35:39,809 INFO L87 Difference]: Start difference. First operand 1609 states and 1774 transitions. Second operand has 137 states, 135 states have (on average 1.6814814814814816) internal successors, (227), 137 states have internal predecessors, (227), 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-12-14 15:35:40,491 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192))) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_ArrVal_5278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5278))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184)))) is different from true [2022-12-14 15:35:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:35:52,418 INFO L93 Difference]: Finished difference Result 1672 states and 1793 transitions. [2022-12-14 15:35:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:35:52,418 INFO L78 Accepts]: Start accepts. Automaton has has 137 states, 135 states have (on average 1.6814814814814816) internal successors, (227), 137 states have internal predecessors, (227), 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 113 [2022-12-14 15:35:52,418 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-12-14 15:35:52,419 INFO L78 Accepts]: Start accepts. Automaton has has 137 states, 135 states have (on average 1.6814814814814816) internal successors, (227), 137 states have internal predecessors, (227), 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 113