./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.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_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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_903f419d-579a-40c3-98ae-f5330385cdc9/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 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 --- 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 09:03:00,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:03:00,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:03:00,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:03:00,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:03:00,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:03:00,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:03:00,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:03:00,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:03:00,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:03:00,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:03:00,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:03:00,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:03:00,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:03:00,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:03:00,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:03:00,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:03:00,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:03:00,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:03:00,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:03:00,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:03:00,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:03:00,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:03:00,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:03:00,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:03:00,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:03:00,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:03:00,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:03:00,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:03:00,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:03:00,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:03:00,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:03:00,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:03:00,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:03:00,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:03:00,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:03:00,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:03:00,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:03:00,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:03:00,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:03:00,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:03:00,307 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 09:03:00,339 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:03:00,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:03:00,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:03:00,340 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:03:00,341 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:03:00,341 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:03:00,341 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:03:00,341 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:03:00,341 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:03:00,341 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 09:03:00,342 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:03:00,342 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:03:00,342 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 09:03:00,342 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 09:03:00,342 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:03:00,342 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 09:03:00,343 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 09:03:00,343 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 09:03:00,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 09:03:00,344 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 09:03:00,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:03:00,344 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:03:00,344 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 09:03:00,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:03:00,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:03:00,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:03:00,345 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 09:03:00,345 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 09:03:00,345 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 09:03:00,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:03:00,345 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 09:03:00,345 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:03:00,346 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:03:00,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:03:00,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:03:00,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:03:00,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:03:00,346 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 09:03:00,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:03:00,347 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 09:03:00,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 09:03:00,347 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:03:00,347 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_903f419d-579a-40c3-98ae-f5330385cdc9/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_903f419d-579a-40c3-98ae-f5330385cdc9/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 -> 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 [2022-12-14 09:03:00,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:03:00,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:03:00,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:03:00,540 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:03:00,540 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:03:00,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2022-12-14 09:03:03,060 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:03:03,273 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:03:03,273 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2022-12-14 09:03:03,283 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/data/ee29d8608/d09f9006de0d42bcbe6c2beeef791828/FLAGe828c2ef8 [2022-12-14 09:03:03,633 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/data/ee29d8608/d09f9006de0d42bcbe6c2beeef791828 [2022-12-14 09:03:03,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:03:03,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:03:03,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:03:03,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:03:03,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:03:03,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:03:03" (1/1) ... [2022-12-14 09:03:03,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68da6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:03, skipping insertion in model container [2022-12-14 09:03:03,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:03:03" (1/1) ... [2022-12-14 09:03:03,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:03:03,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:03:03,945 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_903f419d-579a-40c3-98ae-f5330385cdc9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i[33021,33034] [2022-12-14 09:03:04,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:03:04,029 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 09:03:04,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5174857d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:04, skipping insertion in model container [2022-12-14 09:03:04,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:03:04,030 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-14 09:03:04,032 INFO L158 Benchmark]: Toolchain (without parser) took 395.63ms. Allocated memory is still 132.1MB. Free memory was 94.6MB in the beginning and 77.6MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 09:03:04,032 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 132.1MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:03:04,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.04ms. Allocated memory is still 132.1MB. Free memory was 94.6MB in the beginning and 77.6MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 09:03:04,034 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.12ms. Allocated memory is still 132.1MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.04ms. Allocated memory is still 132.1MB. Free memory was 94.6MB in the beginning and 77.6MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: 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_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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_903f419d-579a-40c3-98ae-f5330385cdc9/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 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 --- 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 09:03:05,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:03:05,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:03:05,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:03:05,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:03:05,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:03:05,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:03:05,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:03:05,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:03:05,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:03:05,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:03:05,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:03:05,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:03:05,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:03:05,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:03:05,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:03:05,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:03:05,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:03:05,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:03:05,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:03:05,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:03:05,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:03:05,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:03:05,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:03:05,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:03:05,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:03:05,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:03:05,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:03:05,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:03:05,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:03:05,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:03:05,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:03:05,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:03:05,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:03:05,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:03:05,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:03:05,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:03:05,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:03:05,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:03:05,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:03:05,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:03:05,399 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 09:03:05,423 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:03:05,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:03:05,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:03:05,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:03:05,424 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:03:05,424 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:03:05,424 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:03:05,424 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:03:05,424 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:03:05,425 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:03:05,425 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:03:05,425 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:03:05,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 09:03:05,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 09:03:05,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:03:05,426 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:03:05,426 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 09:03:05,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:03:05,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:03:05,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:03:05,426 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 09:03:05,426 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 09:03:05,427 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 09:03:05,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:03:05,427 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 09:03:05,427 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 09:03:05,427 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 09:03:05,427 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:03:05,427 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:03:05,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:03:05,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 09:03:05,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:03:05,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:03:05,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:03:05,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:03:05,428 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 09:03:05,428 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 09:03:05,428 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:03:05,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 09:03:05,429 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_903f419d-579a-40c3-98ae-f5330385cdc9/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_903f419d-579a-40c3-98ae-f5330385cdc9/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 -> 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 [2022-12-14 09:03:05,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:03:05,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:03:05,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:03:05,655 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:03:05,655 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:03:05,656 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2022-12-14 09:03:08,307 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:03:08,526 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:03:08,527 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2022-12-14 09:03:08,540 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/data/74e67358b/d164d1fd2a4b4680aa1aece2a959a209/FLAGe2e086263 [2022-12-14 09:03:08,554 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/data/74e67358b/d164d1fd2a4b4680aa1aece2a959a209 [2022-12-14 09:03:08,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:03:08,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:03:08,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:03:08,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:03:08,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:03:08,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:03:08" (1/1) ... [2022-12-14 09:03:08,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4218f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:08, skipping insertion in model container [2022-12-14 09:03:08,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:03:08" (1/1) ... [2022-12-14 09:03:08,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:03:08,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:03:08,936 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_903f419d-579a-40c3-98ae-f5330385cdc9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i[33021,33034] [2022-12-14 09:03:09,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:03:09,016 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-14 09:03:09,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:03:09,045 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_903f419d-579a-40c3-98ae-f5330385cdc9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i[33021,33034] [2022-12-14 09:03:09,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:03:09,081 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:03:09,100 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_903f419d-579a-40c3-98ae-f5330385cdc9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i[33021,33034] [2022-12-14 09:03:09,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:03:09,153 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:03:09,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:09 WrapperNode [2022-12-14 09:03:09,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:03:09,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:03:09,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:03:09,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:03:09,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:09" (1/1) ... [2022-12-14 09:03:09,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:09" (1/1) ... [2022-12-14 09:03:09,225 INFO L138 Inliner]: procedures = 180, calls = 237, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 788 [2022-12-14 09:03:09,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:03:09,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:03:09,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:03:09,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:03:09,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:09" (1/1) ... [2022-12-14 09:03:09,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:09" (1/1) ... [2022-12-14 09:03:09,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:09" (1/1) ... [2022-12-14 09:03:09,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:09" (1/1) ... [2022-12-14 09:03:09,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:09" (1/1) ... [2022-12-14 09:03:09,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:09" (1/1) ... [2022-12-14 09:03:09,269 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:09" (1/1) ... [2022-12-14 09:03:09,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:09" (1/1) ... [2022-12-14 09:03:09,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:03:09,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:03:09,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:03:09,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:03:09,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:09" (1/1) ... [2022-12-14 09:03:09,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:03:09,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:03:09,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:03:09,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:03:09,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-14 09:03:09,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 09:03:09,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 09:03:09,336 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 09:03:09,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-14 09:03:09,336 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-14 09:03:09,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 09:03:09,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 09:03:09,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 09:03:09,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 09:03:09,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 09:03:09,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 09:03:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 09:03:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 09:03:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:03:09,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:03:09,498 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:03:09,500 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:03:09,504 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-14 09:03:12,159 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:03:12,166 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:03:12,166 INFO L300 CfgBuilder]: Removed 40 assume(true) statements. [2022-12-14 09:03:12,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:03:12 BoogieIcfgContainer [2022-12-14 09:03:12,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:03:12,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:03:12,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:03:12,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:03:12,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:03:08" (1/3) ... [2022-12-14 09:03:12,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6530725c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:03:12, skipping insertion in model container [2022-12-14 09:03:12,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:03:09" (2/3) ... [2022-12-14 09:03:12,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6530725c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:03:12, skipping insertion in model container [2022-12-14 09:03:12,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:03:12" (3/3) ... [2022-12-14 09:03:12,174 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test1-2.i [2022-12-14 09:03:12,188 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:03:12,188 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 435 error locations. [2022-12-14 09:03:12,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:03:12,232 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;@5eb3e4de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:03:12,232 INFO L358 AbstractCegarLoop]: Starting to check reachability of 435 error locations. [2022-12-14 09:03:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 866 states, 418 states have (on average 2.2535885167464116) internal successors, (942), 860 states have internal predecessors, (942), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 09:03:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 09:03:12,245 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:12,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 09:03:12,246 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:12,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-12-14 09:03:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:12,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530383717] [2022-12-14 09:03:12,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:12,263 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 09:03:12,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:12,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:12,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:12,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 09:03:12,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:12,404 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 09:03:12,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:03:12,405 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:12,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530383717] [2022-12-14 09:03:12,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530383717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:12,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:03:12,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:03:12,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391217152] [2022-12-14 09:03:12,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:12,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 09:03:12,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:12,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 09:03:12,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 09:03:12,439 INFO L87 Difference]: Start difference. First operand has 866 states, 418 states have (on average 2.2535885167464116) internal successors, (942), 860 states have internal predecessors, (942), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) 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 09:03:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:12,483 INFO L93 Difference]: Finished difference Result 857 states and 914 transitions. [2022-12-14 09:03:12,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 09:03:12,484 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 09:03:12,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:12,496 INFO L225 Difference]: With dead ends: 857 [2022-12-14 09:03:12,496 INFO L226 Difference]: Without dead ends: 855 [2022-12-14 09:03:12,497 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 09:03:12,499 INFO L413 NwaCegarLoop]: 914 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, 914 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 09:03:12,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:03:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-12-14 09:03:12,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2022-12-14 09:03:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 413 states have (on average 2.1452784503631963) internal successors, (886), 849 states have internal predecessors, (886), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 09:03:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 912 transitions. [2022-12-14 09:03:12,579 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 912 transitions. Word has length 5 [2022-12-14 09:03:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:12,579 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 912 transitions. [2022-12-14 09:03:12,579 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 09:03:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 912 transitions. [2022-12-14 09:03:12,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 09:03:12,580 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:12,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 09:03:12,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:12,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:12,782 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:12,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-12-14 09:03:12,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:12,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535446370] [2022-12-14 09:03:12,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:12,786 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 09:03:12,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:12,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:12,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:12,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 09:03:12,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:13,006 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 09:03:13,019 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 09:03:13,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:03:13,019 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:13,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535446370] [2022-12-14 09:03:13,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535446370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:13,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:03:13,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:03:13,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631611923] [2022-12-14 09:03:13,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:13,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:03:13,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:13,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:03:13,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:03:13,022 INFO L87 Difference]: Start difference. First operand 855 states and 912 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 09:03:14,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:14,307 INFO L93 Difference]: Finished difference Result 813 states and 871 transitions. [2022-12-14 09:03:14,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:03:14,309 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 09:03:14,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:14,314 INFO L225 Difference]: With dead ends: 813 [2022-12-14 09:03:14,314 INFO L226 Difference]: Without dead ends: 813 [2022-12-14 09:03:14,314 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 09:03:14,315 INFO L413 NwaCegarLoop]: 542 mSDtfsCounter, 594 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:03:14,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 660 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 09:03:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-12-14 09:03:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 806. [2022-12-14 09:03:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 413 states have (on average 2.026634382566586) internal successors, (837), 800 states have internal predecessors, (837), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 09:03:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 863 transitions. [2022-12-14 09:03:14,332 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 863 transitions. Word has length 5 [2022-12-14 09:03:14,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:14,332 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 863 transitions. [2022-12-14 09:03:14,332 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 09:03:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 863 transitions. [2022-12-14 09:03:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 09:03:14,332 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:14,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 09:03:14,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:14,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:14,534 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:14,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-12-14 09:03:14,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:14,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657668661] [2022-12-14 09:03:14,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:14,539 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 09:03:14,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:14,540 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:14,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:14,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 09:03:14,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:14,626 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 09:03:14,641 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 09:03:14,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:03:14,641 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:14,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657668661] [2022-12-14 09:03:14,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657668661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:14,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:03:14,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:03:14,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500698058] [2022-12-14 09:03:14,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:14,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:03:14,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:14,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:03:14,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:03:14,644 INFO L87 Difference]: Start difference. First operand 806 states and 863 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 09:03:16,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:16,144 INFO L93 Difference]: Finished difference Result 873 states and 934 transitions. [2022-12-14 09:03:16,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:03:16,145 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 09:03:16,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:16,147 INFO L225 Difference]: With dead ends: 873 [2022-12-14 09:03:16,147 INFO L226 Difference]: Without dead ends: 873 [2022-12-14 09:03:16,147 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 09:03:16,148 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 254 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:03:16,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1061 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 09:03:16,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-12-14 09:03:16,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 828. [2022-12-14 09:03:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 445 states have (on average 2.006741573033708) internal successors, (893), 822 states have internal predecessors, (893), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 09:03:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 919 transitions. [2022-12-14 09:03:16,159 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 919 transitions. Word has length 5 [2022-12-14 09:03:16,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:16,160 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 919 transitions. [2022-12-14 09:03:16,160 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 09:03:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 919 transitions. [2022-12-14 09:03:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 09:03:16,160 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:16,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 09:03:16,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:16,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:16,362 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:16,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:16,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1156729148, now seen corresponding path program 1 times [2022-12-14 09:03:16,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:16,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013859253] [2022-12-14 09:03:16,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:16,365 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 09:03:16,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:16,369 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:16,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:16,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 09:03:16,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:16,487 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 09:03:16,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:03:16,487 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:16,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013859253] [2022-12-14 09:03:16,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013859253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:16,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:03:16,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:03:16,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143248538] [2022-12-14 09:03:16,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:16,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:03:16,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:16,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:03:16,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:03:16,488 INFO L87 Difference]: Start difference. First operand 828 states and 919 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 09:03:16,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:16,557 INFO L93 Difference]: Finished difference Result 1408 states and 1559 transitions. [2022-12-14 09:03:16,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:03:16,561 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 09:03:16,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:16,565 INFO L225 Difference]: With dead ends: 1408 [2022-12-14 09:03:16,565 INFO L226 Difference]: Without dead ends: 1408 [2022-12-14 09:03:16,565 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 09:03:16,566 INFO L413 NwaCegarLoop]: 1072 mSDtfsCounter, 567 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1919 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:03:16,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1919 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:03:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2022-12-14 09:03:16,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 829. [2022-12-14 09:03:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 446 states have (on average 2.004484304932735) internal successors, (894), 823 states have internal predecessors, (894), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 09:03:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 920 transitions. [2022-12-14 09:03:16,580 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 920 transitions. Word has length 6 [2022-12-14 09:03:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:16,580 INFO L495 AbstractCegarLoop]: Abstraction has 829 states and 920 transitions. [2022-12-14 09:03:16,581 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 09:03:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 920 transitions. [2022-12-14 09:03:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 09:03:16,581 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:16,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:03:16,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:16,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:16,782 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:16,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:16,783 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-12-14 09:03:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:16,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742576370] [2022-12-14 09:03:16,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:16,784 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 09:03:16,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:16,786 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:16,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:16,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 09:03:16,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:16,906 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 09:03:16,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:03:16,907 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:16,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742576370] [2022-12-14 09:03:16,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742576370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:16,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:03:16,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:03:16,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456146336] [2022-12-14 09:03:16,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:16,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:03:16,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:16,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:03:16,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:03:16,908 INFO L87 Difference]: Start difference. First operand 829 states and 920 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 09:03:16,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:16,938 INFO L93 Difference]: Finished difference Result 793 states and 883 transitions. [2022-12-14 09:03:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:03:16,939 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 09:03:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:16,942 INFO L225 Difference]: With dead ends: 793 [2022-12-14 09:03:16,942 INFO L226 Difference]: Without dead ends: 793 [2022-12-14 09:03:16,942 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 09:03:16,943 INFO L413 NwaCegarLoop]: 805 mSDtfsCounter, 771 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 835 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 09:03:16,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 835 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:03:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2022-12-14 09:03:16,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 787. [2022-12-14 09:03:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 428 states have (on average 1.9883177570093458) internal successors, (851), 781 states have internal predecessors, (851), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 09:03:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 877 transitions. [2022-12-14 09:03:16,960 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 877 transitions. Word has length 11 [2022-12-14 09:03:16,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:16,960 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 877 transitions. [2022-12-14 09:03:16,960 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 09:03:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 877 transitions. [2022-12-14 09:03:16,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 09:03:16,961 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:16,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:03:16,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:17,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:17,161 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:17,162 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-12-14 09:03:17,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:17,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486273318] [2022-12-14 09:03:17,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:17,162 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 09:03:17,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:17,163 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:17,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:17,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 09:03:17,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:17,258 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 09:03:17,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:03:17,258 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:17,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486273318] [2022-12-14 09:03:17,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486273318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:17,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:03:17,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:03:17,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138779015] [2022-12-14 09:03:17,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:17,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:03:17,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:17,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:03:17,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:03:17,259 INFO L87 Difference]: Start difference. First operand 787 states and 877 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 09:03:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:17,314 INFO L93 Difference]: Finished difference Result 772 states and 855 transitions. [2022-12-14 09:03:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:03:17,315 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 09:03:17,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:17,319 INFO L225 Difference]: With dead ends: 772 [2022-12-14 09:03:17,319 INFO L226 Difference]: Without dead ends: 772 [2022-12-14 09:03:17,320 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 09:03:17,320 INFO L413 NwaCegarLoop]: 760 mSDtfsCounter, 752 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1543 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 09:03:17,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1543 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:03:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2022-12-14 09:03:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 765. [2022-12-14 09:03:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 420 states have (on average 1.957142857142857) internal successors, (822), 759 states have internal predecessors, (822), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 09:03:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 848 transitions. [2022-12-14 09:03:17,330 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 848 transitions. Word has length 13 [2022-12-14 09:03:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:17,330 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 848 transitions. [2022-12-14 09:03:17,330 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 09:03:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 848 transitions. [2022-12-14 09:03:17,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 09:03:17,331 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:17,331 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 09:03:17,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:17,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:17,533 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:17,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-12-14 09:03:17,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:17,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629968310] [2022-12-14 09:03:17,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:17,537 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 09:03:17,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:17,541 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:17,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:17,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 09:03:17,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:17,682 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 09:03:17,729 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 09:03:17,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:03:17,729 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:17,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629968310] [2022-12-14 09:03:17,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629968310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:17,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:03:17,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:03:17,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983431749] [2022-12-14 09:03:17,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:17,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:03:17,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:17,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:03:17,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:03:17,731 INFO L87 Difference]: Start difference. First operand 765 states and 848 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 09:03:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:19,247 INFO L93 Difference]: Finished difference Result 992 states and 1106 transitions. [2022-12-14 09:03:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:03:19,247 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 09:03:19,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:19,251 INFO L225 Difference]: With dead ends: 992 [2022-12-14 09:03:19,251 INFO L226 Difference]: Without dead ends: 992 [2022-12-14 09:03:19,251 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 09:03:19,252 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 1147 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:03:19,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 716 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 09:03:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-12-14 09:03:19,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 761. [2022-12-14 09:03:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 420 states have (on average 1.9476190476190476) internal successors, (818), 755 states have internal predecessors, (818), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 09:03:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 844 transitions. [2022-12-14 09:03:19,270 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 844 transitions. Word has length 27 [2022-12-14 09:03:19,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:19,271 INFO L495 AbstractCegarLoop]: Abstraction has 761 states and 844 transitions. [2022-12-14 09:03:19,271 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 09:03:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 844 transitions. [2022-12-14 09:03:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 09:03:19,271 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:19,272 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 09:03:19,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:19,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:19,472 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:19,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:19,473 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-12-14 09:03:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:19,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981712605] [2022-12-14 09:03:19,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:19,473 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 09:03:19,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:19,474 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:19,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:19,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 09:03:19,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:19,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 5 [2022-12-14 09:03:19,706 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 09:03:19,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:03:19,707 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:19,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981712605] [2022-12-14 09:03:19,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981712605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:19,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:03:19,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:03:19,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293238214] [2022-12-14 09:03:19,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:19,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:03:19,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:19,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:03:19,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:03:19,709 INFO L87 Difference]: Start difference. First operand 761 states and 844 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 09:03:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:21,831 INFO L93 Difference]: Finished difference Result 1042 states and 1126 transitions. [2022-12-14 09:03:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:03:21,832 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 09:03:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:21,834 INFO L225 Difference]: With dead ends: 1042 [2022-12-14 09:03:21,834 INFO L226 Difference]: Without dead ends: 1042 [2022-12-14 09:03:21,834 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 09:03:21,834 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 561 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:03:21,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1248 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 09:03:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2022-12-14 09:03:21,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 757. [2022-12-14 09:03:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 420 states have (on average 1.938095238095238) internal successors, (814), 751 states have internal predecessors, (814), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 09:03:21,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 840 transitions. [2022-12-14 09:03:21,843 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 840 transitions. Word has length 27 [2022-12-14 09:03:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:21,843 INFO L495 AbstractCegarLoop]: Abstraction has 757 states and 840 transitions. [2022-12-14 09:03:21,843 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 09:03:21,843 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 840 transitions. [2022-12-14 09:03:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 09:03:21,844 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:21,844 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 09:03:21,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:22,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:22,046 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:22,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:22,047 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-12-14 09:03:22,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:22,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353339205] [2022-12-14 09:03:22,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:22,049 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 09:03:22,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:22,052 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:22,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:22,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 09:03:22,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:22,233 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 09:03:22,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:03:22,233 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:22,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353339205] [2022-12-14 09:03:22,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353339205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:22,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:03:22,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:03:22,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127646285] [2022-12-14 09:03:22,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:22,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:03:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:22,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:03:22,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:03:22,234 INFO L87 Difference]: Start difference. First operand 757 states and 840 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 09:03:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:22,268 INFO L93 Difference]: Finished difference Result 757 states and 836 transitions. [2022-12-14 09:03:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:03:22,268 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 09:03:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:22,270 INFO L225 Difference]: With dead ends: 757 [2022-12-14 09:03:22,270 INFO L226 Difference]: Without dead ends: 757 [2022-12-14 09:03:22,270 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 09:03:22,271 INFO L413 NwaCegarLoop]: 754 mSDtfsCounter, 721 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1521 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 09:03:22,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1521 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:03:22,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-12-14 09:03:22,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 751. [2022-12-14 09:03:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 414 states have (on average 1.9420289855072463) internal successors, (804), 745 states have internal predecessors, (804), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 09:03:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 830 transitions. [2022-12-14 09:03:22,286 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 830 transitions. Word has length 42 [2022-12-14 09:03:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:22,286 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 830 transitions. [2022-12-14 09:03:22,286 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 09:03:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 830 transitions. [2022-12-14 09:03:22,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 09:03:22,287 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:22,287 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 09:03:22,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:22,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:22,488 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:22,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-12-14 09:03:22,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:22,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873275650] [2022-12-14 09:03:22,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:22,490 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 09:03:22,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:22,492 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:22,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:22,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 09:03:22,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:22,878 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 09:03:22,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:03:22,879 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:22,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873275650] [2022-12-14 09:03:22,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873275650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:22,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:03:22,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:03:22,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039706808] [2022-12-14 09:03:22,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:22,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:03:22,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:22,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:03:22,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:03:22,880 INFO L87 Difference]: Start difference. First operand 751 states and 830 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 09:03:23,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:23,074 INFO L93 Difference]: Finished difference Result 992 states and 1080 transitions. [2022-12-14 09:03:23,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:03:23,074 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 09:03:23,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:23,077 INFO L225 Difference]: With dead ends: 992 [2022-12-14 09:03:23,077 INFO L226 Difference]: Without dead ends: 992 [2022-12-14 09:03:23,077 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 09:03:23,077 INFO L413 NwaCegarLoop]: 833 mSDtfsCounter, 269 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:03:23,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1461 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:03:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-12-14 09:03:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 797. [2022-12-14 09:03:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 460 states have (on average 1.8478260869565217) internal successors, (850), 791 states have internal predecessors, (850), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 09:03:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 876 transitions. [2022-12-14 09:03:23,091 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 876 transitions. Word has length 50 [2022-12-14 09:03:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:23,091 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 876 transitions. [2022-12-14 09:03:23,092 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 09:03:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 876 transitions. [2022-12-14 09:03:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 09:03:23,092 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:23,093 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 09:03:23,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:23,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:23,294 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:23,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-12-14 09:03:23,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:23,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314116083] [2022-12-14 09:03:23,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:23,295 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 09:03:23,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:23,297 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:23,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:23,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 09:03:23,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:23,567 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 09:03:23,572 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 09:03:23,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:03:23,920 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 09:03:23,935 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 09:03:23,935 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 09:03:23,949 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 09:03:23,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:03:23,950 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:23,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314116083] [2022-12-14 09:03:23,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314116083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:23,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:03:23,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:03:23,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976133669] [2022-12-14 09:03:23,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:23,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:03:23,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:23,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:03:23,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:03:23,951 INFO L87 Difference]: Start difference. First operand 797 states and 876 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 09:03:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:25,241 INFO L93 Difference]: Finished difference Result 766 states and 846 transitions. [2022-12-14 09:03:25,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:03:25,242 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 09:03:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:25,244 INFO L225 Difference]: With dead ends: 766 [2022-12-14 09:03:25,244 INFO L226 Difference]: Without dead ends: 766 [2022-12-14 09:03:25,244 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 09:03:25,245 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 777 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:03:25,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 571 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 09:03:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-12-14 09:03:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 727. [2022-12-14 09:03:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 428 states have (on average 1.7429906542056075) internal successors, (746), 721 states have internal predecessors, (746), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 09:03:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 772 transitions. [2022-12-14 09:03:25,251 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 772 transitions. Word has length 53 [2022-12-14 09:03:25,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:25,252 INFO L495 AbstractCegarLoop]: Abstraction has 727 states and 772 transitions. [2022-12-14 09:03:25,252 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 09:03:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 772 transitions. [2022-12-14 09:03:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 09:03:25,253 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:25,253 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 09:03:25,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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)] Forceful destruction successful, exit code 0 [2022-12-14 09:03:25,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:25,454 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:25,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:25,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-12-14 09:03:25,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:25,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840149781] [2022-12-14 09:03:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:25,458 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 09:03:25,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:25,461 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:25,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:25,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 09:03:25,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:25,690 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 09:03:25,699 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 09:03:25,718 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 09:03:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:03:25,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:03:25,726 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:25,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840149781] [2022-12-14 09:03:25,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840149781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:25,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:03:25,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:03:25,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931339248] [2022-12-14 09:03:25,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:25,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:03:25,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:25,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:03:25,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:03:25,727 INFO L87 Difference]: Start difference. First operand 727 states and 772 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 09:03:27,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:27,282 INFO L93 Difference]: Finished difference Result 726 states and 771 transitions. [2022-12-14 09:03:27,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 09:03:27,283 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 09:03:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:27,287 INFO L225 Difference]: With dead ends: 726 [2022-12-14 09:03:27,287 INFO L226 Difference]: Without dead ends: 726 [2022-12-14 09:03:27,287 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 09:03:27,291 INFO L413 NwaCegarLoop]: 720 mSDtfsCounter, 4 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:03:27,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1842 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 09:03:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-12-14 09:03:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2022-12-14 09:03:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 428 states have (on average 1.7406542056074767) internal successors, (745), 720 states have internal predecessors, (745), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 09:03:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 771 transitions. [2022-12-14 09:03:27,297 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 771 transitions. Word has length 58 [2022-12-14 09:03:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:27,297 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 771 transitions. [2022-12-14 09:03:27,297 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 09:03:27,297 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 771 transitions. [2022-12-14 09:03:27,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 09:03:27,298 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:27,298 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 09:03:27,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:27,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:27,498 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:27,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-12-14 09:03:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:27,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448699200] [2022-12-14 09:03:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:27,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:03:27,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:27,500 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:27,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:27,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 09:03:27,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:27,694 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 09:03:27,714 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 09:03:27,722 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 09:03:27,765 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 09:03:27,770 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 09:03:27,785 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 09:03:27,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:03:27,786 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:27,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448699200] [2022-12-14 09:03:27,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448699200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:27,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:03:27,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:03:27,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453630333] [2022-12-14 09:03:27,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:27,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:03:27,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:27,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:03:27,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:03:27,787 INFO L87 Difference]: Start difference. First operand 726 states and 771 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 09:03:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:29,991 INFO L93 Difference]: Finished difference Result 725 states and 770 transitions. [2022-12-14 09:03:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 09:03:29,992 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 09:03:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:29,994 INFO L225 Difference]: With dead ends: 725 [2022-12-14 09:03:29,994 INFO L226 Difference]: Without dead ends: 725 [2022-12-14 09:03:29,994 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 09:03:29,994 INFO L413 NwaCegarLoop]: 720 mSDtfsCounter, 2 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:03:29,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1868 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-12-14 09:03:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-12-14 09:03:29,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2022-12-14 09:03:30,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 427 states have (on average 1.7423887587822013) internal successors, (744), 719 states have internal predecessors, (744), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 09:03:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 770 transitions. [2022-12-14 09:03:30,001 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 770 transitions. Word has length 58 [2022-12-14 09:03:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:30,001 INFO L495 AbstractCegarLoop]: Abstraction has 725 states and 770 transitions. [2022-12-14 09:03:30,001 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 09:03:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 770 transitions. [2022-12-14 09:03:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 09:03:30,002 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:30,002 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 09:03:30,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:30,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:30,202 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:30,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:30,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1015821406, now seen corresponding path program 1 times [2022-12-14 09:03:30,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:30,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189562284] [2022-12-14 09:03:30,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:30,203 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 09:03:30,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:30,204 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:30,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:30,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 09:03:30,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:30,411 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 09:03:30,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:03:30,412 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:30,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189562284] [2022-12-14 09:03:30,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189562284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:30,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:03:30,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:03:30,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808762941] [2022-12-14 09:03:30,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:30,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:03:30,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:30,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:03:30,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:03:30,413 INFO L87 Difference]: Start difference. First operand 725 states and 770 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 09:03:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:30,451 INFO L93 Difference]: Finished difference Result 728 states and 774 transitions. [2022-12-14 09:03:30,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:03:30,452 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 09:03:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:30,454 INFO L225 Difference]: With dead ends: 728 [2022-12-14 09:03:30,454 INFO L226 Difference]: Without dead ends: 728 [2022-12-14 09:03:30,454 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 09:03:30,454 INFO L413 NwaCegarLoop]: 720 mSDtfsCounter, 2 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:03:30,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2155 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:03:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-12-14 09:03:30,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2022-12-14 09:03:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 429 states have (on average 1.7412587412587412) internal successors, (747), 722 states have internal predecessors, (747), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-12-14 09:03:30,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 774 transitions. [2022-12-14 09:03:30,466 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 774 transitions. Word has length 66 [2022-12-14 09:03:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:30,467 INFO L495 AbstractCegarLoop]: Abstraction has 728 states and 774 transitions. [2022-12-14 09:03:30,467 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 09:03:30,467 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 774 transitions. [2022-12-14 09:03:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 09:03:30,467 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:30,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:03:30,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:30,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:30,668 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:30,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:30,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1543934731, now seen corresponding path program 1 times [2022-12-14 09:03:30,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:30,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383669136] [2022-12-14 09:03:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:30,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:03:30,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:30,670 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:30,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:30,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 09:03:30,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:30,893 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 09:03:30,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:03:30,952 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 09:03:30,952 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:30,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383669136] [2022-12-14 09:03:30,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383669136] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:03:30,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1459866835] [2022-12-14 09:03:30,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:30,953 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:03:30,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:03:30,954 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:03:30,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-12-14 09:03:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:31,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 09:03:31,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:31,269 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 09:03:31,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:03:31,298 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 09:03:31,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1459866835] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:03:31,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562833030] [2022-12-14 09:03:31,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:31,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:03:31,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:03:31,300 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:03:31,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 09:03:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:31,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 09:03:31,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:31,503 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 09:03:31,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:03:31,534 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 09:03:31,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562833030] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:03:31,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 09:03:31,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-12-14 09:03:31,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569557503] [2022-12-14 09:03:31,534 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 09:03:31,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 09:03:31,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:31,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 09:03:31,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:03:31,536 INFO L87 Difference]: Start difference. First operand 728 states and 774 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 09:03:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:31,679 INFO L93 Difference]: Finished difference Result 740 states and 791 transitions. [2022-12-14 09:03:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 09:03:31,680 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 09:03:31,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:31,682 INFO L225 Difference]: With dead ends: 740 [2022-12-14 09:03:31,682 INFO L226 Difference]: Without dead ends: 740 [2022-12-14 09:03:31,682 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 09:03:31,682 INFO L413 NwaCegarLoop]: 721 mSDtfsCounter, 11 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:03:31,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3587 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:03:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-12-14 09:03:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 738. [2022-12-14 09:03:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 438 states have (on average 1.7397260273972603) internal successors, (762), 731 states have internal predecessors, (762), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-12-14 09:03:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 789 transitions. [2022-12-14 09:03:31,690 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 789 transitions. Word has length 67 [2022-12-14 09:03:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:31,690 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 789 transitions. [2022-12-14 09:03:31,690 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 09:03:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 789 transitions. [2022-12-14 09:03:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-14 09:03:31,691 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:31,691 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 09:03:31,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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)] Forceful destruction successful, exit code 0 [2022-12-14 09:03:31,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2022-12-14 09:03:32,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 09:03:32,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:03:32,293 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:03:32,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1247879710, now seen corresponding path program 2 times [2022-12-14 09:03:32,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:03:32,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89166839] [2022-12-14 09:03:32,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 09:03:32,295 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 09:03:32,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:03:32,296 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:32,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:03:32,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 09:03:32,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:03:32,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 09:03:32,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:32,720 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 09:03:32,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:03:32,872 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 09:03:32,872 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:03:32,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89166839] [2022-12-14 09:03:32,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89166839] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:03:32,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2113293171] [2022-12-14 09:03:32,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 09:03:32,873 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:03:32,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:03:32,874 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:03:32,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-12-14 09:03:33,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 09:03:33,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:03:33,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 09:03:33,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:33,735 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 09:03:33,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:03:33,800 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 09:03:33,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2113293171] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:03:33,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297196722] [2022-12-14 09:03:33,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 09:03:33,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:03:33,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:03:33,802 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:03:33,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 09:03:52,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 09:03:52,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:03:52,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 09:03:52,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:53,045 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 09:03:53,045 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 09:03:53,074 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 09:03:53,375 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:03:53,375 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 09:03:53,434 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 09:03:53,462 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 09:03:53,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:03:53,555 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-12-14 09:03:53,555 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 09:03:53,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297196722] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:03:53,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 09:03:53,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-12-14 09:03:53,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727454692] [2022-12-14 09:03:53,640 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 09:03:53,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 09:03:53,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:03:53,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 09:03:53,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=550, Unknown=10, NotChecked=0, Total=650 [2022-12-14 09:03:53,642 INFO L87 Difference]: Start difference. First operand 738 states and 789 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 09:04:00,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:04:00,359 INFO L93 Difference]: Finished difference Result 765 states and 824 transitions. [2022-12-14 09:04:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 09:04:00,360 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 09:04:00,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:04:00,364 INFO L225 Difference]: With dead ends: 765 [2022-12-14 09:04:00,364 INFO L226 Difference]: Without dead ends: 761 [2022-12-14 09:04:00,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=478, Invalid=2791, Unknown=37, NotChecked=0, Total=3306 [2022-12-14 09:04:00,364 INFO L413 NwaCegarLoop]: 477 mSDtfsCounter, 884 mSDsluCounter, 5427 mSDsCounter, 0 mSdLazyCounter, 4363 mSolverCounterSat, 51 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 5904 SdHoareTripleChecker+Invalid, 4421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 4363 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-12-14 09:04:00,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 5904 Invalid, 4421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 4363 Invalid, 7 Unknown, 0 Unchecked, 5.6s Time] [2022-12-14 09:04:00,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-12-14 09:04:00,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 746. [2022-12-14 09:04:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 447 states have (on average 1.7293064876957494) internal successors, (773), 739 states have internal predecessors, (773), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-12-14 09:04:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 800 transitions. [2022-12-14 09:04:00,371 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 800 transitions. Word has length 70 [2022-12-14 09:04:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:04:00,372 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 800 transitions. [2022-12-14 09:04:00,372 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 09:04:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 800 transitions. [2022-12-14 09:04:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 09:04:00,372 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:04:00,372 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 09:04:00,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2022-12-14 09:04:00,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:04:00,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 09:04:00,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:04:00,975 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:04:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:04:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1189044927, now seen corresponding path program 1 times [2022-12-14 09:04:00,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:04:00,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118105473] [2022-12-14 09:04:00,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:04:00,978 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 09:04:00,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:04:00,981 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:04:00,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:04:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:04:01,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 09:04:01,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:04:01,308 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 09:04:01,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:04:01,755 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 09:04:01,755 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:04:01,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118105473] [2022-12-14 09:04:01,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118105473] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:04:01,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [773316658] [2022-12-14 09:04:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:04:01,756 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:04:01,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:04:01,756 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:04:01,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-12-14 09:04:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:04:02,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 09:04:02,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:04:02,168 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 09:04:02,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:04:02,291 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 09:04:02,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [773316658] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:04:02,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291696924] [2022-12-14 09:04:02,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:04:02,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:04:02,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:04:02,293 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:04:02,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 09:04:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:04:02,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 09:04:02,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:04:02,565 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 09:04:02,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:04:03,297 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 09:04:03,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291696924] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:04:03,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 09:04:03,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-12-14 09:04:03,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030758265] [2022-12-14 09:04:03,298 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 09:04:03,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 09:04:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:04:03,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 09:04:03,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 09:04:03,301 INFO L87 Difference]: Start difference. First operand 746 states and 800 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 09:04:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:04:06,125 INFO L93 Difference]: Finished difference Result 788 states and 857 transitions. [2022-12-14 09:04:06,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-14 09:04:06,126 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 09:04:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:04:06,127 INFO L225 Difference]: With dead ends: 788 [2022-12-14 09:04:06,127 INFO L226 Difference]: Without dead ends: 782 [2022-12-14 09:04:06,129 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 09:04:06,130 INFO L413 NwaCegarLoop]: 728 mSDtfsCounter, 57 mSDsluCounter, 10111 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 10839 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 09:04:06,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 10839 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 09:04:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-12-14 09:04:06,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 764. [2022-12-14 09:04:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 465 states have (on average 1.7118279569892474) internal successors, (796), 757 states have internal predecessors, (796), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-12-14 09:04:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 823 transitions. [2022-12-14 09:04:06,142 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 823 transitions. Word has length 76 [2022-12-14 09:04:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:04:06,143 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 823 transitions. [2022-12-14 09:04:06,143 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 09:04:06,143 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 823 transitions. [2022-12-14 09:04:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-14 09:04:06,143 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:04:06,143 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 09:04:06,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 09:04:06,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:04:06,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2022-12-14 09:04:06,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 09:04:06,744 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:04:06,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:04:06,745 INFO L85 PathProgramCache]: Analyzing trace with hash 244644863, now seen corresponding path program 2 times [2022-12-14 09:04:06,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:04:06,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249874648] [2022-12-14 09:04:06,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 09:04:06,745 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 09:04:06,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:04:06,746 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:04:06,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:04:07,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 09:04:07,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:04:07,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 09:04:07,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:04:07,590 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 09:04:07,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:04:10,717 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 09:04:10,717 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:04:10,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249874648] [2022-12-14 09:04:10,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249874648] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:04:10,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [292182398] [2022-12-14 09:04:10,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 09:04:10,717 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:04:10,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:04:10,718 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:04:10,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-12-14 09:04:11,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 09:04:11,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:04:11,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 09:04:11,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:04:12,070 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 09:04:12,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:04:12,942 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 09:04:12,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [292182398] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:04:12,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213173837] [2022-12-14 09:04:12,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 09:04:12,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:04:12,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:04:12,943 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:04:12,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 09:04:21,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 09:04:21,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:04:21,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 09:04:21,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:04:21,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 09:04:21,798 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 09:04:21,798 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 09:04:21,885 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 09:04:21,891 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 09:04:22,154 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 09:04:22,159 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 09:04:22,411 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 09:04:22,420 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2375))) (exists ((v_ArrVal_2376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2376) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-12-14 09:04:22,431 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2378))) (exists ((v_ArrVal_2377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2377))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-12-14 09:04:22,440 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_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 09:04:22,449 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2382))) (exists ((v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2381))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-12-14 09:04:22,457 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 09:04:22,466 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386)))) is different from true [2022-12-14 09:04:22,475 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 09:04:22,484 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 09:04:22,497 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-12-14 09:04:22,508 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394)))) is different from true [2022-12-14 09:04:22,517 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395)))) is different from true [2022-12-14 09:04:22,526 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 09:04:22,535 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:04:22,549 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 09:04:22,559 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403)))) is different from true [2022-12-14 09:04:22,568 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 09:04:22,579 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 09:04:22,590 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-12-14 09:04:22,601 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:04:22,611 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 09:04:22,643 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:04:22,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:04:22,649 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 09:04:22,832 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 09:04:22,838 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 09:04:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 252 not checked. [2022-12-14 09:04:22,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:04:23,685 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 09:04:23,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213173837] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:04:23,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 09:04:23,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 30] total 79 [2022-12-14 09:04:23,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071626166] [2022-12-14 09:04:23,691 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 09:04:23,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-12-14 09:04:23,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:04:23,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-12-14 09:04:23,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=2845, Unknown=43, NotChecked=3014, Total=6642 [2022-12-14 09:04:23,693 INFO L87 Difference]: Start difference. First operand 764 states and 823 transitions. Second operand has 79 states, 78 states have (on average 2.423076923076923) internal successors, (189), 79 states have internal predecessors, (189), 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 09:05:04,449 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32)))) (.cse1 (bvult |c_#Ultimate.C_memset_#t~loopctr187| |c_#Ultimate.C_memset_#amount|))) (and (exists ((v_ArrVal_2375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2375))) (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_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (exists ((v_ArrVal_2378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2378))) (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_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (or (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr187| (_ bv3 32)) |c_#Ultimate.C_memset_#amount|) .cse0 (not (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr187| (_ bv2 32)) |c_#Ultimate.C_memset_#amount|))) (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_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_2382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2382))) (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (exists ((v_ArrVal_2376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2376) |c_#memory_$Pointer$.base|)) (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_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (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_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_ArrVal_2377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2377))) (or .cse1 .cse0) (exists ((v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2381))) (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))) (or .cse0 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr187| (_ bv1 32)) |c_#Ultimate.C_memset_#amount|) (not .cse1)) (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_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386))) (exists ((v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|)) (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_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (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_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395))) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410))) (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 09:05:11,042 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2375))) (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_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (exists ((v_ArrVal_2378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2378))) (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_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_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_2382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2382))) (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (exists ((v_ArrVal_2376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2376) |c_#memory_$Pointer$.base|)) (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_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (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_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_ArrVal_2377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2377))) (exists ((v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2381))) (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_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386))) (exists ((v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|)) (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_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (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_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395))) (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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410))) (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 09:05:11,065 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2375))) (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_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (exists ((v_ArrVal_2378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2378))) (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_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_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_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (exists ((v_ArrVal_2376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2376) |c_#memory_$Pointer$.base|)) (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_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_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (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_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_ArrVal_2377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2377))) (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_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386))) (exists ((v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|)) (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_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (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_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395))) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-12-14 09:05:11,123 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_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (exists ((v_ArrVal_2378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2378))) (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_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_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_2382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2382))) (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (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_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_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (exists ((v_ArrVal_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_ArrVal_2377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2377))) (exists ((v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2381))) (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_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386))) (exists ((v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|)) (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_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395))) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-12-14 09:05:11,134 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_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (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_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_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_2382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2382))) (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (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_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_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (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_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2381))) (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_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|)) (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_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (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_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395))) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-12-14 09:05:11,278 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (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_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_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_2382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2382))) (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (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_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (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_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2381))) (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_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386))) (exists ((v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|)) (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_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (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_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395))) (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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-12-14 09:05:11,410 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_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (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_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_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_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (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_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_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (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_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_ArrVal_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_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386))) (exists ((v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (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_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395))) (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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-12-14 09:05:11,524 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_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (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_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_ArrVal_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_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (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_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_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (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_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386))) (exists ((v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|)) (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_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395))) (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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-12-14 09:05:11,633 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_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (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_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_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_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (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_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_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (exists ((v_ArrVal_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_ArrVal_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_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|)) (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_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395))) (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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-12-14 09:05:12,080 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (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_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_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_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (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_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (exists ((v_ArrVal_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_ArrVal_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_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_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_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395))) (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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410))) (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 09:05:12,149 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2375))) (exists ((v_ArrVal_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (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_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_ArrVal_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_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_ArrVal_2376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2376) |c_#memory_$Pointer$.base|)) (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_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (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_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395))) (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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-12-14 09:05:12,338 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (exists ((v_ArrVal_2378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2378))) (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_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (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_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (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_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (exists ((v_ArrVal_2377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2377))) (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_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_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395))) (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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-12-14 09:05:12,346 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_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (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_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (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_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_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-12-14 09:05:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:05:30,694 INFO L93 Difference]: Finished difference Result 1217 states and 1375 transitions. [2022-12-14 09:05:30,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-12-14 09:05:30,695 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 2.423076923076923) internal successors, (189), 79 states have internal predecessors, (189), 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 09:05:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:05:30,697 INFO L225 Difference]: With dead ends: 1217 [2022-12-14 09:05:30,697 INFO L226 Difference]: Without dead ends: 1203 [2022-12-14 09:05:30,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 350 SyntacticMatches, 15 SemanticMatches, 178 ConstructedPredicates, 35 IntricatePredicates, 0 DeprecatedPredicates, 4691 ImplicationChecksByTransitivity, 48.3s TimeCoverageRelationStatistics Valid=3462, Invalid=16746, Unknown=812, NotChecked=11200, Total=32220 [2022-12-14 09:05:30,702 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 1338 mSDsluCounter, 14620 mSDsCounter, 0 mSdLazyCounter, 13753 mSolverCounterSat, 191 mSolverCounterUnsat, 256 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 15131 SdHoareTripleChecker+Invalid, 40290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 13753 IncrementalHoareTripleChecker+Invalid, 256 IncrementalHoareTripleChecker+Unknown, 26090 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:05:30,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 15131 Invalid, 40290 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [191 Valid, 13753 Invalid, 256 Unknown, 26090 Unchecked, 22.5s Time] [2022-12-14 09:05:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2022-12-14 09:05:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 799. [2022-12-14 09:05:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 501 states have (on average 1.6746506986027945) internal successors, (839), 792 states have internal predecessors, (839), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-12-14 09:05:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 866 transitions. [2022-12-14 09:05:30,717 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 866 transitions. Word has length 88 [2022-12-14 09:05:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:05:30,717 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 866 transitions. [2022-12-14 09:05:30,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 2.423076923076923) internal successors, (189), 79 states have internal predecessors, (189), 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 09:05:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 866 transitions. [2022-12-14 09:05:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 09:05:30,718 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:05:30,718 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 09:05:30,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 09:05:30,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-12-14 09:05:31,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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)] Forceful destruction successful, exit code 0 [2022-12-14 09:05:31,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:05:31,321 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:05:31,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:05:31,322 INFO L85 PathProgramCache]: Analyzing trace with hash 166055575, now seen corresponding path program 1 times [2022-12-14 09:05:31,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:05:31,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239765474] [2022-12-14 09:05:31,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:05:31,324 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 09:05:31,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:05:31,326 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:05:31,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:05:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:05:32,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 09:05:32,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:05:32,123 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 09:05:32,197 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 09:05:32,198 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 09:05:32,221 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 09:05:32,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 09:05:32,381 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 09:05:32,489 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_2831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2831)))) is different from true [2022-12-14 09:05:32,578 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_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_2835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2835) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:05:32,887 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_2848 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2848) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:05:33,483 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:05:33,484 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 09:05:33,584 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:05:33,584 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 09:05:33,606 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 09:05:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-12-14 09:05:33,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:05:36,049 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 09:05:36,051 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:05:36,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239765474] [2022-12-14 09:05:36,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239765474] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:05:36,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2115531805] [2022-12-14 09:05:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:05:36,052 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:05:36,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:05:36,053 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:05:36,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-12-14 09:05:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:05:38,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 09:05:38,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:05:39,010 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:05:39,010 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 09:05:39,255 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-12-14 09:05:39,255 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 09:05:39,306 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 09:05:39,507 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 09:05:42,285 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:05:42,285 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 09:05:42,468 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:05:42,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:05:42,501 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 09:05:42,571 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 09:05:42,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:05:42,589 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 09:05:42,601 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 09:05:42,832 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 09:05:42,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2115531805] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:05:42,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280340902] [2022-12-14 09:05:42,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:05:42,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:05:42,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:05:42,835 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:05:42,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 09:05:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:05:43,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 09:05:43,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:05:43,316 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 09:05:43,316 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 09:05:43,354 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 09:05:43,519 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3729))) is different from true [2022-12-14 09:05:43,523 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3730))) is different from true [2022-12-14 09:05:43,528 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3731) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 09:05:43,532 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3732) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 09:05:43,536 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3733))) is different from true [2022-12-14 09:05:43,540 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3734))) is different from true [2022-12-14 09:05:43,544 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3735 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3735))) is different from true [2022-12-14 09:05:43,548 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3736))) is different from true [2022-12-14 09:05:43,552 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3737))) is different from true [2022-12-14 09:05:43,556 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3738) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 09:05:43,560 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3739) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 09:05:43,564 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3740))) is different from true [2022-12-14 09:05:43,568 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3741 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3741))) is different from true [2022-12-14 09:05:43,572 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3742 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3742) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 09:05:43,576 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3743))) is different from true [2022-12-14 09:05:43,581 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3744))) is different from true [2022-12-14 09:05:43,585 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3745) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 09:05:43,589 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3746))) is different from true [2022-12-14 09:05:43,593 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3747))) is different from true [2022-12-14 09:05:43,597 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3748))) is different from true [2022-12-14 09:05:43,602 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3749) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 09:05:43,606 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3750))) is different from true [2022-12-14 09:05:43,610 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3751))) is different from true [2022-12-14 09:05:43,615 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3752))) is different from true [2022-12-14 09:05:43,619 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3753))) is different from true [2022-12-14 09:05:43,623 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3754))) is different from true [2022-12-14 09:05:43,627 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3755 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3755))) is different from true [2022-12-14 09:05:43,632 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3756))) is different from true [2022-12-14 09:05:43,636 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3757))) is different from true [2022-12-14 09:05:43,640 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3758))) is different from true [2022-12-14 09:05:43,644 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3759) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 09:05:43,649 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3760))) is different from true [2022-12-14 09:05:43,654 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3761))) is different from true [2022-12-14 09:05:43,659 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3762 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3762))) is different from true [2022-12-14 09:05:43,663 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3763) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 09:05:43,668 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3764 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3764) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 09:05:43,672 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3765) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 09:05:43,676 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3766))) is different from true [2022-12-14 09:05:43,681 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3767) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 09:05:43,685 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3768))) is different from true [2022-12-14 09:05:43,689 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3769 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3769) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 09:05:43,693 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3770))) is different from true [2022-12-14 09:05:43,698 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3771))) is different from true [2022-12-14 09:05:43,703 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3772) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 09:05:43,723 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:05:43,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 09:05:43,805 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:05:43,805 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 09:05:45,898 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 09:05:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-12-14 09:05:45,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:05:45,923 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-12-14 09:05:45,924 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 09:05:46,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280340902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:05:46,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:05:46,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 54] total 74 [2022-12-14 09:05:46,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350193994] [2022-12-14 09:05:46,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:05:46,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-12-14 09:05:46,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:05:46,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-12-14 09:05:46,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=799, Unknown=97, NotChecked=5668, Total=6806 [2022-12-14 09:05:46,333 INFO L87 Difference]: Start difference. First operand 799 states and 866 transitions. Second operand has 75 states, 71 states have (on average 3.2535211267605635) internal successors, (231), 75 states have internal predecessors, (231), 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 09:05:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:05:54,339 INFO L93 Difference]: Finished difference Result 1253 states and 1362 transitions. [2022-12-14 09:05:54,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-12-14 09:05:54,340 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 71 states have (on average 3.2535211267605635) internal successors, (231), 75 states have internal predecessors, (231), 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 09:05:54,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:05:54,342 INFO L225 Difference]: With dead ends: 1253 [2022-12-14 09:05:54,342 INFO L226 Difference]: Without dead ends: 1253 [2022-12-14 09:05:54,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 193 SyntacticMatches, 89 SemanticMatches, 97 ConstructedPredicates, 52 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=458, Invalid=1791, Unknown=121, NotChecked=7332, Total=9702 [2022-12-14 09:05:54,344 INFO L413 NwaCegarLoop]: 521 mSDtfsCounter, 1818 mSDsluCounter, 3156 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 57 mSolverCounterUnsat, 608 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1828 SdHoareTripleChecker+Valid, 3677 SdHoareTripleChecker+Invalid, 41893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 608 IncrementalHoareTripleChecker+Unknown, 38277 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:05:54,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1828 Valid, 3677 Invalid, 41893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2951 Invalid, 608 Unknown, 38277 Unchecked, 7.1s Time] [2022-12-14 09:05:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2022-12-14 09:05:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 798. [2022-12-14 09:05:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 501 states have (on average 1.6726546906187625) internal successors, (838), 791 states have internal predecessors, (838), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-12-14 09:05:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 865 transitions. [2022-12-14 09:05:54,352 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 865 transitions. Word has length 113 [2022-12-14 09:05:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:05:54,353 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 865 transitions. [2022-12-14 09:05:54,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 71 states have (on average 3.2535211267605635) internal successors, (231), 75 states have internal predecessors, (231), 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 09:05:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 865 transitions. [2022-12-14 09:05:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 09:05:54,353 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:05:54,353 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 09:05:54,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2022-12-14 09:05:54,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-14 09:05:54,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:05:54,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:05:54,956 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:05:54,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:05:54,958 INFO L85 PathProgramCache]: Analyzing trace with hash 166055576, now seen corresponding path program 1 times [2022-12-14 09:05:54,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:05:54,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244349959] [2022-12-14 09:05:54,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:05:54,960 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 09:05:54,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:05:54,961 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:05:54,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:05:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:05:55,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-14 09:05:55,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:05:55,764 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 09:05:55,843 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 09:05:55,843 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 09:05:55,850 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 09:05:55,867 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 09:05:55,877 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 09:05:55,969 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 09:05:55,973 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 09:05:56,023 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_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_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 09:05:56,033 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 09:05:56,078 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191)))) is different from true [2022-12-14 09:05:56,177 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 09:05:56,188 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 09:05:56,200 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 09:05:56,212 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 09:05:56,224 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 09:05:56,234 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 09:05:56,274 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 09:05:56,340 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 09:05:56,375 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 09:05:56,413 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 09:05:56,448 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 09:05:56,458 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 09:05:56,468 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 09:05:56,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_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 09:05:56,488 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$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4239))) (exists ((v_ArrVal_4238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4238) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:05:56,498 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4241 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4241))) (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$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4240)))) is different from true [2022-12-14 09:05:56,508 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$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4242))) (exists ((v_ArrVal_4243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4243)))) is different from true [2022-12-14 09:05:56,518 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_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4245)))) is different from true [2022-12-14 09:05:56,528 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4247) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4246) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32)))) is different from true [2022-12-14 09:05:56,538 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 09:05:56,548 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 09:05:56,558 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 09:05:56,568 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 09:05:56,578 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 09:05:56,588 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 09:05:56,598 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 09:05:56,609 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 09:05:56,619 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 09:05:56,629 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 09:05:56,639 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_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269)))) is different from true [2022-12-14 09:05:56,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_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 09:05:56,691 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:05:56,691 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 09:05:56,700 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 09:05:56,796 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:05:56,797 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 09:05:56,808 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 09:05:56,827 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 09:05:56,831 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 09:05:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 935 not checked. [2022-12-14 09:05:56,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:05:57,022 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 09:05:57,059 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 09:05:57,849 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 09:05:57,857 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:05:57,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244349959] [2022-12-14 09:05:57,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244349959] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:05:57,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [858783174] [2022-12-14 09:05:57,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:05:57,858 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:05:57,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:05:57,859 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:05:57,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-12-14 09:07:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:07:58,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 113 conjunts are in the unsatisfiable core [2022-12-14 09:07:58,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:07:58,122 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 09:07:58,244 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 09:07:58,245 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 09:07:58,251 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 09:07:58,262 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 09:07:58,271 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 09:07:58,334 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 09:07:58,339 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 09:07:58,387 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 09:07:58,398 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_4732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4732))) (exists ((v_ArrVal_4733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4733)))) is different from true [2022-12-14 09:07:58,409 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 09:07:58,421 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 09:07:58,432 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_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739))) (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 09:07:58,443 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 09:07:58,454 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_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742))) (exists ((v_ArrVal_4743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4743) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 09:07:58,465 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 09:07:58,476 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 09:07:58,488 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)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748))) (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:07:58,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_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 09:07:58,510 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 09:07:58,521 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_4754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4754) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4755) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 09:07:58,532 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 09:07:58,547 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$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758))) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 09:07:58,558 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 09:07:58,569 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 09:07:58,580 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_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 09:07:58,592 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 09:07:58,603 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$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:07:58,614 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 09:07:58,627 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 09:07:58,639 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_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:07:58,650 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 09:07:58,662 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 09:07:58,674 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_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781))) (exists ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4780) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:07:58,686 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 09:07:58,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_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 09:07:58,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_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 09:07:58,723 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 09:07:58,735 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 09:07:58,746 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 09:07:58,758 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 09:07:58,770 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 09:07:58,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_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 09:07:58,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_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 09:07:58,807 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 09:07:58,818 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$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 09:07:58,830 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 09:07:58,842 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4808 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4808) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809)))) is different from true [2022-12-14 09:07:58,858 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 09:07:58,870 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 09:07:58,882 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 09:07:58,894 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 09:07:58,937 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:07:58,937 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 09:07:58,949 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 09:07:59,013 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:07:59,013 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 09:07:59,025 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 09:07:59,047 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 09:07:59,052 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 09:07:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-12-14 09:07:59,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:07:59,118 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 09:07:59,149 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 09:07:59,960 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 09:07:59,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [858783174] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:07:59,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707676450] [2022-12-14 09:07:59,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:07:59,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:07:59,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:07:59,969 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:07:59,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 09:08:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:08:00,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-14 09:08:00,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:08:00,459 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 09:08:00,469 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 09:08:00,470 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 09:08:00,481 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 09:08:00,491 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 09:08:00,536 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 09:08:00,541 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 09:08:00,582 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_5275 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5275) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276)))) is different from true [2022-12-14 09:08:00,621 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 09:08:00,631 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_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:08:00,640 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 09:08:00,651 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$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5286))) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:08:00,660 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 09:08:00,669 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 09:08:00,679 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 09:08:00,688 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 09:08:00,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_5295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5295))) (exists ((v_ArrVal_5296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5296)))) is different from true [2022-12-14 09:08:00,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_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297))) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:08:00,718 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)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5300))) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:08:00,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_5301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5301))) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302)))) is different from true [2022-12-14 09:08:00,737 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$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303))) (exists ((v_ArrVal_5304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5304)))) is different from true [2022-12-14 09:08:00,747 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 09:08:00,756 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$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307)))) is different from true [2022-12-14 09:08:00,766 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 09:08:00,775 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 09:08:00,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_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 09:08:00,797 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 09:08:00,808 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 09:08:00,820 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 09:08:00,831 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 09:08:00,842 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 09:08:00,852 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_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5326)))) is different from true [2022-12-14 09:08:00,866 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 09:08:00,875 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$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 09:08:00,885 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 09:08:00,894 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 09:08:00,903 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 09:08:00,915 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 09:08:00,927 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_5340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5340))) (exists ((v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5339)))) is different from true [2022-12-14 09:08:00,939 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 09:08:00,950 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 09:08:00,961 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 09:08:00,970 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)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 09:08:00,979 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 09:08:00,989 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_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352))) (exists ((v_ArrVal_5351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5351) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:08:00,998 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 09:08:01,007 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 09:08:01,017 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)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5357))) (exists ((v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5358) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:08:01,027 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 09:08:01,037 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 09:08:01,072 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:08:01,073 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 09:08:01,081 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 09:08:01,134 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:08:01,134 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 09:08:01,140 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 09:08:01,165 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 09:08:01,170 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 09:08:01,174 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 09:08:01,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:08:01,228 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 09:08:01,259 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 09:08:01,942 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 09:08:01,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707676450] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:08:01,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:08:01,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 52, 53] total 131 [2022-12-14 09:08:01,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055950731] [2022-12-14 09:08:01,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:08:01,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-12-14 09:08:01,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:08:01,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-12-14 09:08:01,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=249, Unknown=138, NotChecked=19630, Total=20306 [2022-12-14 09:08:01,953 INFO L87 Difference]: Start difference. First operand 798 states and 865 transitions. Second operand has 132 states, 130 states have (on average 1.7384615384615385) internal successors, (226), 132 states have internal predecessors, (226), 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 09:08:10,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:08:10,179 INFO L93 Difference]: Finished difference Result 804 states and 872 transitions. [2022-12-14 09:08:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 09:08:10,180 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 130 states have (on average 1.7384615384615385) internal successors, (226), 132 states have internal predecessors, (226), 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 09:08:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:08:10,182 INFO L225 Difference]: With dead ends: 804 [2022-12-14 09:08:10,182 INFO L226 Difference]: Without dead ends: 804 [2022-12-14 09:08:10,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 201 SyntacticMatches, 17 SemanticMatches, 149 ConstructedPredicates, 130 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=352, Invalid=443, Unknown=145, NotChecked=21710, Total=22650 [2022-12-14 09:08:10,184 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 826 mSDsluCounter, 2261 mSDsCounter, 0 mSdLazyCounter, 3238 mSolverCounterSat, 15 mSolverCounterUnsat, 310 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 2743 SdHoareTripleChecker+Invalid, 91976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3238 IncrementalHoareTripleChecker+Invalid, 310 IncrementalHoareTripleChecker+Unknown, 88413 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-12-14 09:08:10,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 2743 Invalid, 91976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3238 Invalid, 310 Unknown, 88413 Unchecked, 7.7s Time] [2022-12-14 09:08:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-12-14 09:08:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 797. [2022-12-14 09:08:10,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 501 states have (on average 1.6706586826347305) internal successors, (837), 790 states have internal predecessors, (837), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-12-14 09:08:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 864 transitions. [2022-12-14 09:08:10,195 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 864 transitions. Word has length 113 [2022-12-14 09:08:10,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:08:10,196 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 864 transitions. [2022-12-14 09:08:10,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 130 states have (on average 1.7384615384615385) internal successors, (226), 132 states have internal predecessors, (226), 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 09:08:10,196 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 864 transitions. [2022-12-14 09:08:10,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 09:08:10,197 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:08:10,197 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:08:10,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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)] Forceful destruction successful, exit code 0 [2022-12-14 09:08:10,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2022-12-14 09:08:10,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-14 09:08:10,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:08:10,800 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-12-14 09:08:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:08:10,801 INFO L85 PathProgramCache]: Analyzing trace with hash -840411099, now seen corresponding path program 1 times [2022-12-14 09:08:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:08:10,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066478956] [2022-12-14 09:08:10,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:08:10,803 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 09:08:10,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:08:10,804 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 09:08:10,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/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 (34)] Waiting until timeout for monitored process [2022-12-14 09:08:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:08:11,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-14 09:08:11,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:08:11,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 09:08:11,932 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 09:08:11,932 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 09:08:11,956 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 09:08:12,052 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 09:08:12,219 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_5837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5837) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 09:08:12,265 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839)))) is different from true [2022-12-14 09:08:12,771 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_5857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5857)))) is different from true [2022-12-14 09:08:12,959 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_5864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5864)))) is different from true [2022-12-14 09:08:13,331 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_5877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5877)))) is different from true [2022-12-14 09:08:13,373 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:08:13,373 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 09:08:13,478 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:08:13,478 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 09:08:13,558 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:08:13,558 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 09:08:13,577 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 09:08:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 741 trivial. 210 not checked. [2022-12-14 09:08:13,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:08:13,732 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2022-12-14 09:08:13,749 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5878))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5879)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 09:08:13,762 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5878))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5879)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 09:08:14,011 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5925))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5878)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5879)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 09:08:14,016 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:08:14,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066478956] [2022-12-14 09:08:14,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066478956] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:08:14,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1297909299] [2022-12-14 09:08:14,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:08:14,016 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:08:14,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:08:14,017 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:08:14,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_903f419d-579a-40c3-98ae-f5330385cdc9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-12-14 09:08:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:08:37,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-14 09:08:37,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:08:37,647 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:08:37,648 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 09:08:37,997 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-12-14 09:08:37,998 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 09:08:38,060 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 09:08:38,079 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 09:08:38,214 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 09:08:38,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 09:08:41,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 09:08:41,422 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 09:08:41,423 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 44 treesize of output 49 [2022-12-14 09:08:41,443 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 09:08:41,443 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 37 treesize of output 29 [2022-12-14 09:08:41,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 09:08:41,479 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 09:08:41,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:08:41,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:08:41,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:08:41,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:08:41,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2022-12-14 09:08:41,720 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 11 [2022-12-14 09:08:41,786 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 09:08:41,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:08:42,646 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-14 09:08:42,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4607 treesize of output 4099 [2022-12-14 09:08:42,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8828 treesize of output 6892 [2022-12-14 09:08:42,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31417 treesize of output 31269