./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW --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 ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 --- 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-4e7fbc6 [2022-11-23 14:25:42,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:25:42,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:25:42,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:25:42,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:25:42,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:25:42,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:25:42,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:25:42,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:25:42,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:25:42,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:25:42,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:25:42,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:25:42,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:25:42,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:25:42,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:25:42,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:25:42,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:25:42,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:25:42,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:25:42,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:25:42,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:25:42,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:25:42,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:25:42,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:25:42,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:25:42,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:25:42,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:25:42,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:25:42,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:25:42,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:25:42,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:25:42,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:25:42,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:25:42,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:25:42,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:25:42,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:25:42,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:25:42,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:25:42,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:25:42,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:25:42,377 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 14:25:42,410 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:25:42,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:25:42,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:25:42,411 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:25:42,412 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:25:42,412 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:25:42,412 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:25:42,412 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:25:42,412 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:25:42,413 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:25:42,413 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:25:42,413 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:25:42,413 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:25:42,413 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:25:42,414 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:25:42,414 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:25:42,414 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:25:42,414 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:25:42,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 14:25:42,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 14:25:42,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:25:42,415 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:25:42,416 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:25:42,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:25:42,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:25:42,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:25:42,416 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 14:25:42,416 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 14:25:42,417 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 14:25:42,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:25:42,417 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:25:42,417 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:25:42,417 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:25:42,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:25:42,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:25:42,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:25:42,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:25:42,418 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:25:42,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:25:42,419 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:25:42,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:25:42,419 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:25:42,419 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_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/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_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW 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 -> ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 [2022-11-23 14:25:42,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:25:42,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:25:42,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:25:42,838 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:25:42,839 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:25:42,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i [2022-11-23 14:25:46,165 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:25:46,683 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:25:46,684 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i [2022-11-23 14:25:46,704 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/data/36d74c3e7/99182a9dea3c4b8db03e626473c14913/FLAG774e7432a [2022-11-23 14:25:46,725 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/data/36d74c3e7/99182a9dea3c4b8db03e626473c14913 [2022-11-23 14:25:46,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:25:46,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:25:46,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:25:46,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:25:46,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:25:46,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:25:46" (1/1) ... [2022-11-23 14:25:46,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@728639a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46, skipping insertion in model container [2022-11-23 14:25:46,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:25:46" (1/1) ... [2022-11-23 14:25:46,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:25:46,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:25:47,336 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_ab18e097-65b2-4147-a056-d8a7cd0191c4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i[33021,33034] [2022-11-23 14:25:47,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:25:47,465 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-23 14:25:47,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@16dccfa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:47, skipping insertion in model container [2022-11-23 14:25:47,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:25:47,477 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-23 14:25:47,479 INFO L158 Benchmark]: Toolchain (without parser) took 746.22ms. Allocated memory is still 157.3MB. Free memory was 122.3MB in the beginning and 105.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 14:25:47,480 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 157.3MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:25:47,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 739.03ms. Allocated memory is still 157.3MB. Free memory was 122.0MB in the beginning and 105.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 14:25:47,482 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.31ms. Allocated memory is still 157.3MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 739.03ms. Allocated memory is still 157.3MB. Free memory was 122.0MB in the beginning and 105.5MB in the end (delta: 16.6MB). 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW --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 ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 --- 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-4e7fbc6 [2022-11-23 14:25:49,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:25:49,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:25:49,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:25:49,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:25:49,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:25:49,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:25:49,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:25:49,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:25:49,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:25:49,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:25:49,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:25:49,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:25:49,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:25:49,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:25:49,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:25:49,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:25:49,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:25:49,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:25:49,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:25:49,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:25:49,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:25:49,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:25:49,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:25:49,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:25:49,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:25:49,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:25:49,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:25:49,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:25:49,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:25:49,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:25:49,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:25:50,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:25:50,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:25:50,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:25:50,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:25:50,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:25:50,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:25:50,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:25:50,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:25:50,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:25:50,032 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-23 14:25:50,067 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:25:50,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:25:50,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:25:50,068 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:25:50,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:25:50,069 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:25:50,069 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:25:50,069 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:25:50,070 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:25:50,070 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:25:50,071 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:25:50,071 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:25:50,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 14:25:50,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 14:25:50,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:25:50,072 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:25:50,073 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:25:50,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:25:50,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:25:50,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:25:50,073 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 14:25:50,073 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 14:25:50,074 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 14:25:50,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:25:50,074 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:25:50,074 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 14:25:50,074 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 14:25:50,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:25:50,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:25:50,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:25:50,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 14:25:50,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:25:50,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:25:50,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:25:50,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:25:50,076 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 14:25:50,076 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 14:25:50,077 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:25:50,077 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 14:25:50,077 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_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/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_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW 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 -> ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 [2022-11-23 14:25:50,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:25:50,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:25:50,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:25:50,547 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:25:50,548 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:25:50,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i [2022-11-23 14:25:53,752 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:25:54,086 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:25:54,087 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i [2022-11-23 14:25:54,102 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/data/fbac6b890/bca49c75af1145a2bed5a8d8c779867f/FLAG180448252 [2022-11-23 14:25:54,122 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/data/fbac6b890/bca49c75af1145a2bed5a8d8c779867f [2022-11-23 14:25:54,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:25:54,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:25:54,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:25:54,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:25:54,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:25:54,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:25:54" (1/1) ... [2022-11-23 14:25:54,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67434623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:54, skipping insertion in model container [2022-11-23 14:25:54,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:25:54" (1/1) ... [2022-11-23 14:25:54,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:25:54,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:25:54,696 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_ab18e097-65b2-4147-a056-d8a7cd0191c4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i[33021,33034] [2022-11-23 14:25:54,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:25:54,875 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-23 14:25:54,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:25:54,918 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_ab18e097-65b2-4147-a056-d8a7cd0191c4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i[33021,33034] [2022-11-23 14:25:54,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:25:54,972 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:25:54,999 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_ab18e097-65b2-4147-a056-d8a7cd0191c4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i[33021,33034] [2022-11-23 14:25:55,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:25:55,105 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:25:55,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:55 WrapperNode [2022-11-23 14:25:55,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:25:55,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:25:55,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:25:55,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:25:55,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:55" (1/1) ... [2022-11-23 14:25:55,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:55" (1/1) ... [2022-11-23 14:25:55,242 INFO L138 Inliner]: procedures = 180, calls = 186, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 624 [2022-11-23 14:25:55,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:25:55,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:25:55,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:25:55,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:25:55,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:55" (1/1) ... [2022-11-23 14:25:55,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:55" (1/1) ... [2022-11-23 14:25:55,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:55" (1/1) ... [2022-11-23 14:25:55,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:55" (1/1) ... [2022-11-23 14:25:55,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:55" (1/1) ... [2022-11-23 14:25:55,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:55" (1/1) ... [2022-11-23 14:25:55,376 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:55" (1/1) ... [2022-11-23 14:25:55,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:55" (1/1) ... [2022-11-23 14:25:55,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:25:55,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:25:55,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:25:55,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:25:55,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:55" (1/1) ... [2022-11-23 14:25:55,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:25:55,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:25:55,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:25:55,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:25:55,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-23 14:25:55,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 14:25:55,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 14:25:55,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 14:25:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-23 14:25:55,522 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-23 14:25:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 14:25:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:25:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 14:25:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 14:25:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 14:25:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:25:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 14:25:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 14:25:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:25:55,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:25:55,785 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:25:55,788 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:25:55,793 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-23 14:25:59,477 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:25:59,498 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:25:59,501 INFO L300 CfgBuilder]: Removed 31 assume(true) statements. [2022-11-23 14:25:59,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:25:59 BoogieIcfgContainer [2022-11-23 14:25:59,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:25:59,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:25:59,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:25:59,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:25:59,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:25:54" (1/3) ... [2022-11-23 14:25:59,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cffd15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:25:59, skipping insertion in model container [2022-11-23 14:25:59,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:55" (2/3) ... [2022-11-23 14:25:59,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cffd15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:25:59, skipping insertion in model container [2022-11-23 14:25:59,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:25:59" (3/3) ... [2022-11-23 14:25:59,522 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test1-1.i [2022-11-23 14:25:59,544 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:25:59,544 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 330 error locations. [2022-11-23 14:25:59,632 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:25:59,639 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;@19bfa6ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:25:59,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 330 error locations. [2022-11-23 14:25:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 667 states, 324 states have (on average 2.2314814814814814) internal successors, (723), 661 states have internal predecessors, (723), 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-11-23 14:25:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 14:25:59,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:25:59,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 14:25:59,655 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:25:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:25:59,665 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-11-23 14:25:59,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:25:59,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329917088] [2022-11-23 14:25:59,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:25:59,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:25:59,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:25:59,686 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:25:59,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-23 14:25:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:25:59,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 14:25:59,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:25:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:25:59,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:25:59,959 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:25:59,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329917088] [2022-11-23 14:25:59,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329917088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:25:59,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:25:59,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:25:59,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91165261] [2022-11-23 14:25:59,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:25:59,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 14:25:59,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:25:59,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 14:25:59,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 14:26:00,002 INFO L87 Difference]: Start difference. First operand has 667 states, 324 states have (on average 2.2314814814814814) internal successors, (723), 661 states have internal predecessors, (723), 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-11-23 14:26:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:00,066 INFO L93 Difference]: Finished difference Result 658 states and 704 transitions. [2022-11-23 14:26:00,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 14:26:00,068 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-23 14:26:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:00,087 INFO L225 Difference]: With dead ends: 658 [2022-11-23 14:26:00,087 INFO L226 Difference]: Without dead ends: 656 [2022-11-23 14:26:00,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 14:26:00,093 INFO L413 NwaCegarLoop]: 704 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, 704 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:00,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:26:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-11-23 14:26:00,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2022-11-23 14:26:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 319 states have (on average 2.1191222570532915) internal successors, (676), 650 states have internal predecessors, (676), 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-11-23 14:26:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 702 transitions. [2022-11-23 14:26:00,192 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 702 transitions. Word has length 5 [2022-11-23 14:26:00,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:00,193 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 702 transitions. [2022-11-23 14:26:00,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:00,193 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 702 transitions. [2022-11-23 14:26:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 14:26:00,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:00,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 14:26:00,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-23 14:26:00,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:00,406 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:00,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:00,406 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-11-23 14:26:00,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:00,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177347008] [2022-11-23 14:26:00,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:00,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:00,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:00,409 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:00,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-23 14:26:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:00,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:26:00,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:00,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:26:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:00,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:00,669 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:00,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177347008] [2022-11-23 14:26:00,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177347008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:00,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:00,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:26:00,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050678532] [2022-11-23 14:26:00,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:00,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:26:00,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:00,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:26:00,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:26:00,683 INFO L87 Difference]: Start difference. First operand 656 states and 702 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:02,362 INFO L93 Difference]: Finished difference Result 614 states and 661 transitions. [2022-11-23 14:26:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:26:02,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-23 14:26:02,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:02,368 INFO L225 Difference]: With dead ends: 614 [2022-11-23 14:26:02,368 INFO L226 Difference]: Without dead ends: 614 [2022-11-23 14:26:02,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:26:02,370 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 594 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:02,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 349 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 14:26:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-11-23 14:26:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 607. [2022-11-23 14:26:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 319 states have (on average 1.9655172413793103) internal successors, (627), 601 states have internal predecessors, (627), 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-11-23 14:26:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 653 transitions. [2022-11-23 14:26:02,403 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 653 transitions. Word has length 5 [2022-11-23 14:26:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:02,403 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 653 transitions. [2022-11-23 14:26:02,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:02,404 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 653 transitions. [2022-11-23 14:26:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 14:26:02,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:02,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 14:26:02,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:26:02,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:02,616 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:02,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-11-23 14:26:02,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:02,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990176245] [2022-11-23 14:26:02,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:02,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:02,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:02,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:02,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-23 14:26:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:02,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:26:02,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:02,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:26:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:02,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:02,772 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:02,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990176245] [2022-11-23 14:26:02,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990176245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:02,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:02,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:26:02,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704066891] [2022-11-23 14:26:02,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:02,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:26:02,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:02,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:26:02,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:26:02,780 INFO L87 Difference]: Start difference. First operand 607 states and 653 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:04,743 INFO L93 Difference]: Finished difference Result 674 states and 724 transitions. [2022-11-23 14:26:04,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:26:04,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-23 14:26:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:04,749 INFO L225 Difference]: With dead ends: 674 [2022-11-23 14:26:04,749 INFO L226 Difference]: Without dead ends: 674 [2022-11-23 14:26:04,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:26:04,750 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 254 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:04,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 748 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-23 14:26:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-11-23 14:26:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 629. [2022-11-23 14:26:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 351 states have (on average 1.9458689458689458) internal successors, (683), 623 states have internal predecessors, (683), 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-11-23 14:26:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 709 transitions. [2022-11-23 14:26:04,776 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 709 transitions. Word has length 5 [2022-11-23 14:26:04,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:04,776 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 709 transitions. [2022-11-23 14:26:04,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 709 transitions. [2022-11-23 14:26:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:26:04,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:04,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:26:04,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:26:04,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:04,991 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:04,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1156729148, now seen corresponding path program 1 times [2022-11-23 14:26:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:04,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709388700] [2022-11-23 14:26:04,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:04,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:04,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:04,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:05,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-23 14:26:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:05,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 14:26:05,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:05,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:05,086 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:05,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709388700] [2022-11-23 14:26:05,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709388700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:05,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:05,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:26:05,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494666846] [2022-11-23 14:26:05,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:05,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:26:05,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:05,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:26:05,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:26:05,089 INFO L87 Difference]: Start difference. First operand 629 states and 709 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:05,206 INFO L93 Difference]: Finished difference Result 1209 states and 1349 transitions. [2022-11-23 14:26:05,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:26:05,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 14:26:05,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:05,221 INFO L225 Difference]: With dead ends: 1209 [2022-11-23 14:26:05,221 INFO L226 Difference]: Without dead ends: 1209 [2022-11-23 14:26:05,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:26:05,225 INFO L413 NwaCegarLoop]: 862 mSDtfsCounter, 567 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:05,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1499 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:26:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2022-11-23 14:26:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 630. [2022-11-23 14:26:05,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 352 states have (on average 1.9431818181818181) internal successors, (684), 624 states have internal predecessors, (684), 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-11-23 14:26:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 710 transitions. [2022-11-23 14:26:05,267 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 710 transitions. Word has length 6 [2022-11-23 14:26:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:05,267 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 710 transitions. [2022-11-23 14:26:05,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 710 transitions. [2022-11-23 14:26:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:26:05,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:05,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:05,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-23 14:26:05,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:05,491 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:05,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:05,491 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-11-23 14:26:05,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:05,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809062610] [2022-11-23 14:26:05,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:05,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:05,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:05,494 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:05,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-23 14:26:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:05,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 14:26:05,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:05,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:05,673 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:05,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809062610] [2022-11-23 14:26:05,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809062610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:05,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:05,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:26:05,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034800456] [2022-11-23 14:26:05,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:05,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:26:05,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:05,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:26:05,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:26:05,675 INFO L87 Difference]: Start difference. First operand 630 states and 710 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:05,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:05,714 INFO L93 Difference]: Finished difference Result 594 states and 673 transitions. [2022-11-23 14:26:05,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:26:05,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-23 14:26:05,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:05,718 INFO L225 Difference]: With dead ends: 594 [2022-11-23 14:26:05,718 INFO L226 Difference]: Without dead ends: 594 [2022-11-23 14:26:05,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:26:05,720 INFO L413 NwaCegarLoop]: 595 mSDtfsCounter, 561 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:05,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 625 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:26:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-11-23 14:26:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 588. [2022-11-23 14:26:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 334 states have (on average 1.9191616766467066) internal successors, (641), 582 states have internal predecessors, (641), 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-11-23 14:26:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 667 transitions. [2022-11-23 14:26:05,736 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 667 transitions. Word has length 11 [2022-11-23 14:26:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:05,736 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 667 transitions. [2022-11-23 14:26:05,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 667 transitions. [2022-11-23 14:26:05,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:26:05,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:05,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:05,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -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-11-23 14:26:05,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:05,954 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:05,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:05,954 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-11-23 14:26:05,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:05,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503928947] [2022-11-23 14:26:05,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:05,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:05,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:05,957 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:05,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-23 14:26:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:06,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:26:06,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:06,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:06,099 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:06,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503928947] [2022-11-23 14:26:06,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503928947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:06,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:06,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:26:06,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327198319] [2022-11-23 14:26:06,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:06,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:26:06,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:06,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:26:06,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:06,102 INFO L87 Difference]: Start difference. First operand 588 states and 667 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:06,184 INFO L93 Difference]: Finished difference Result 573 states and 645 transitions. [2022-11-23 14:26:06,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:26:06,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 14:26:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:06,187 INFO L225 Difference]: With dead ends: 573 [2022-11-23 14:26:06,188 INFO L226 Difference]: Without dead ends: 573 [2022-11-23 14:26:06,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:06,189 INFO L413 NwaCegarLoop]: 550 mSDtfsCounter, 542 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:06,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1123 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:26:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-11-23 14:26:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 566. [2022-11-23 14:26:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 326 states have (on average 1.8773006134969326) internal successors, (612), 560 states have internal predecessors, (612), 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-11-23 14:26:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 638 transitions. [2022-11-23 14:26:06,202 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 638 transitions. Word has length 13 [2022-11-23 14:26:06,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:06,203 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 638 transitions. [2022-11-23 14:26:06,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 638 transitions. [2022-11-23 14:26:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 14:26:06,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:06,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:06,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-23 14:26:06,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:06,421 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:06,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:06,422 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-11-23 14:26:06,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:06,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588188074] [2022-11-23 14:26:06,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:06,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:06,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:06,424 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:06,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-23 14:26:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:06,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:26:06,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:06,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:26:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:06,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:06,682 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:06,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588188074] [2022-11-23 14:26:06,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588188074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:06,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:06,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:26:06,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933088583] [2022-11-23 14:26:06,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:06,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:26:06,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:06,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:26:06,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:06,684 INFO L87 Difference]: Start difference. First operand 566 states and 638 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:08,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:08,163 INFO L93 Difference]: Finished difference Result 610 states and 703 transitions. [2022-11-23 14:26:08,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:26:08,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-23 14:26:08,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:08,167 INFO L225 Difference]: With dead ends: 610 [2022-11-23 14:26:08,167 INFO L226 Difference]: Without dead ends: 610 [2022-11-23 14:26:08,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:08,168 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 956 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:08,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 383 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 14:26:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-23 14:26:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 562. [2022-11-23 14:26:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 326 states have (on average 1.8650306748466257) internal successors, (608), 556 states have internal predecessors, (608), 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-11-23 14:26:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 634 transitions. [2022-11-23 14:26:08,191 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 634 transitions. Word has length 27 [2022-11-23 14:26:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:08,191 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 634 transitions. [2022-11-23 14:26:08,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 634 transitions. [2022-11-23 14:26:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 14:26:08,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:08,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:08,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-23 14:26:08,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:08,405 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:08,406 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-11-23 14:26:08,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:08,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827261618] [2022-11-23 14:26:08,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:08,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:08,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:08,408 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:08,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-23 14:26:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:08,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:26:08,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:08,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 5 [2022-11-23 14:26:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:08,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:08,733 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:08,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827261618] [2022-11-23 14:26:08,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827261618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:08,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:08,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:26:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309035729] [2022-11-23 14:26:08,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:08,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:26:08,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:08,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:26:08,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:08,735 INFO L87 Difference]: Start difference. First operand 562 states and 634 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:11,105 INFO L93 Difference]: Finished difference Result 644 states and 706 transitions. [2022-11-23 14:26:11,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:26:11,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-23 14:26:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:11,109 INFO L225 Difference]: With dead ends: 644 [2022-11-23 14:26:11,110 INFO L226 Difference]: Without dead ends: 644 [2022-11-23 14:26:11,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:11,111 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 351 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:11,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 917 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-23 14:26:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-11-23 14:26:11,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 558. [2022-11-23 14:26:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 326 states have (on average 1.852760736196319) internal successors, (604), 552 states have internal predecessors, (604), 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-11-23 14:26:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 630 transitions. [2022-11-23 14:26:11,127 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 630 transitions. Word has length 27 [2022-11-23 14:26:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:11,128 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 630 transitions. [2022-11-23 14:26:11,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 630 transitions. [2022-11-23 14:26:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-23 14:26:11,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:11,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:11,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-23 14:26:11,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:11,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:11,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-11-23 14:26:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:11,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915373954] [2022-11-23 14:26:11,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:11,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:11,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:11,347 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:11,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-23 14:26:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:11,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:26:11,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:11,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:11,651 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:11,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915373954] [2022-11-23 14:26:11,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915373954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:11,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:11,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:26:11,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984997450] [2022-11-23 14:26:11,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:11,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:26:11,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:11,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:26:11,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:11,654 INFO L87 Difference]: Start difference. First operand 558 states and 630 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:11,719 INFO L93 Difference]: Finished difference Result 558 states and 626 transitions. [2022-11-23 14:26:11,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:26:11,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-23 14:26:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:11,722 INFO L225 Difference]: With dead ends: 558 [2022-11-23 14:26:11,722 INFO L226 Difference]: Without dead ends: 558 [2022-11-23 14:26:11,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:11,725 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 511 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:11,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1101 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:26:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-11-23 14:26:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 552. [2022-11-23 14:26:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 320 states have (on average 1.85625) internal successors, (594), 546 states have internal predecessors, (594), 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-11-23 14:26:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 620 transitions. [2022-11-23 14:26:11,743 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 620 transitions. Word has length 42 [2022-11-23 14:26:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:11,745 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 620 transitions. [2022-11-23 14:26:11,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 620 transitions. [2022-11-23 14:26:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-23 14:26:11,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:11,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:11,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-23 14:26:11,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:11,963 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:11,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:11,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-11-23 14:26:11,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:11,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656826414] [2022-11-23 14:26:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:11,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:11,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:11,970 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:11,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-23 14:26:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:12,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:26:12,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:12,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:12,530 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:12,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656826414] [2022-11-23 14:26:12,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656826414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:12,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:12,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:26:12,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76254228] [2022-11-23 14:26:12,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:12,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:26:12,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:12,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:26:12,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:26:12,531 INFO L87 Difference]: Start difference. First operand 552 states and 620 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:12,635 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2022-11-23 14:26:12,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:26:12,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-11-23 14:26:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:12,639 INFO L225 Difference]: With dead ends: 598 [2022-11-23 14:26:12,639 INFO L226 Difference]: Without dead ends: 598 [2022-11-23 14:26:12,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:26:12,640 INFO L413 NwaCegarLoop]: 552 mSDtfsCounter, 67 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:12,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1008 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:26:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-11-23 14:26:12,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2022-11-23 14:26:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 366 states have (on average 1.7486338797814207) internal successors, (640), 592 states have internal predecessors, (640), 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-11-23 14:26:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 666 transitions. [2022-11-23 14:26:12,654 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 666 transitions. Word has length 50 [2022-11-23 14:26:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:12,654 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 666 transitions. [2022-11-23 14:26:12,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 666 transitions. [2022-11-23 14:26:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-23 14:26:12,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:12,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:12,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-23 14:26:12,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:12,869 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:12,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:12,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-11-23 14:26:12,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:12,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855928893] [2022-11-23 14:26:12,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:12,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:12,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:12,872 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:12,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-23 14:26:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:13,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 14:26:13,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:13,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:26:13,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:26:13,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:26:13,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 14:26:13,985 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:26:13,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:26:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:14,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:14,004 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:14,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855928893] [2022-11-23 14:26:14,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855928893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:14,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:14,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:26:14,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989575013] [2022-11-23 14:26:14,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:14,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:26:14,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:14,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:26:14,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:14,006 INFO L87 Difference]: Start difference. First operand 598 states and 666 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:15,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:15,450 INFO L93 Difference]: Finished difference Result 567 states and 636 transitions. [2022-11-23 14:26:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:26:15,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-11-23 14:26:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:15,455 INFO L225 Difference]: With dead ends: 567 [2022-11-23 14:26:15,455 INFO L226 Difference]: Without dead ends: 567 [2022-11-23 14:26:15,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:15,456 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 441 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:15,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 311 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 14:26:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-11-23 14:26:15,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 528. [2022-11-23 14:26:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 334 states have (on average 1.6047904191616766) internal successors, (536), 522 states have internal predecessors, (536), 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-11-23 14:26:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 562 transitions. [2022-11-23 14:26:15,489 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 562 transitions. Word has length 53 [2022-11-23 14:26:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:15,489 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 562 transitions. [2022-11-23 14:26:15,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 562 transitions. [2022-11-23 14:26:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 14:26:15,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:15,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:15,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -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-11-23 14:26:15,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:15,698 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:15,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:15,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-11-23 14:26:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:15,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832828456] [2022-11-23 14:26:15,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:15,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:15,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:15,702 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:15,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-23 14:26:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:16,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 14:26:16,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:16,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:26:16,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:26:16,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:26:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:16,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:16,116 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:16,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832828456] [2022-11-23 14:26:16,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832828456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:16,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:16,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:26:16,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053246283] [2022-11-23 14:26:16,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:16,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:26:16,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:16,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:26:16,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:16,121 INFO L87 Difference]: Start difference. First operand 528 states and 562 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:18,164 INFO L93 Difference]: Finished difference Result 527 states and 561 transitions. [2022-11-23 14:26:18,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:26:18,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-23 14:26:18,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:18,168 INFO L225 Difference]: With dead ends: 527 [2022-11-23 14:26:18,169 INFO L226 Difference]: Without dead ends: 527 [2022-11-23 14:26:18,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:26:18,170 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 4 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:18,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1317 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-23 14:26:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-11-23 14:26:18,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2022-11-23 14:26:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 334 states have (on average 1.6017964071856288) internal successors, (535), 521 states have internal predecessors, (535), 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-11-23 14:26:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 561 transitions. [2022-11-23 14:26:18,184 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 561 transitions. Word has length 58 [2022-11-23 14:26:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:18,184 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 561 transitions. [2022-11-23 14:26:18,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 561 transitions. [2022-11-23 14:26:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 14:26:18,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:18,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:18,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -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-11-23 14:26:18,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:18,401 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:18,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:18,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-11-23 14:26:18,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:18,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457110092] [2022-11-23 14:26:18,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:18,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:18,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:18,403 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:18,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-23 14:26:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:18,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 14:26:18,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:18,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:26:18,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:26:18,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:26:18,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-23 14:26:18,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 14:26:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:18,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:18,834 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:18,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457110092] [2022-11-23 14:26:18,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457110092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:18,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:18,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:26:18,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873459681] [2022-11-23 14:26:18,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:18,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:26:18,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:18,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:26:18,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:18,837 INFO L87 Difference]: Start difference. First operand 527 states and 561 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:21,259 INFO L93 Difference]: Finished difference Result 526 states and 560 transitions. [2022-11-23 14:26:21,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:26:21,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-23 14:26:21,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:21,264 INFO L225 Difference]: With dead ends: 526 [2022-11-23 14:26:21,265 INFO L226 Difference]: Without dead ends: 526 [2022-11-23 14:26:21,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:26:21,266 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 2 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:21,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1327 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-23 14:26:21,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-11-23 14:26:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2022-11-23 14:26:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 333 states have (on average 1.6036036036036037) internal successors, (534), 520 states have internal predecessors, (534), 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-11-23 14:26:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 560 transitions. [2022-11-23 14:26:21,280 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 560 transitions. Word has length 58 [2022-11-23 14:26:21,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:21,280 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 560 transitions. [2022-11-23 14:26:21,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 560 transitions. [2022-11-23 14:26:21,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-23 14:26:21,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:21,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:21,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-23 14:26:21,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:21,499 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:21,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:21,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1630154942, now seen corresponding path program 1 times [2022-11-23 14:26:21,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:21,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360579353] [2022-11-23 14:26:21,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:21,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:21,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:21,501 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:21,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-23 14:26:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:21,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:26:21,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:21,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:21,800 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:21,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360579353] [2022-11-23 14:26:21,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360579353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:21,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:21,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:26:21,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044281849] [2022-11-23 14:26:21,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:21,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:26:21,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:21,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:26:21,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:21,805 INFO L87 Difference]: Start difference. First operand 526 states and 560 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:26:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:21,856 INFO L93 Difference]: Finished difference Result 529 states and 564 transitions. [2022-11-23 14:26:21,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:26:21,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-11-23 14:26:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:21,862 INFO L225 Difference]: With dead ends: 529 [2022-11-23 14:26:21,862 INFO L226 Difference]: Without dead ends: 529 [2022-11-23 14:26:21,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:21,863 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 2 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1525 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-11-23 14:26:21,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1525 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:26:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-11-23 14:26:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2022-11-23 14:26:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 335 states have (on average 1.6029850746268657) internal successors, (537), 523 states have internal predecessors, (537), 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-11-23 14:26:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 564 transitions. [2022-11-23 14:26:21,885 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 564 transitions. Word has length 66 [2022-11-23 14:26:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:21,886 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 564 transitions. [2022-11-23 14:26:21,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:26:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 564 transitions. [2022-11-23 14:26:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-23 14:26:21,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:21,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:21,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-23 14:26:22,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:22,094 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:22,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash 584186051, now seen corresponding path program 1 times [2022-11-23 14:26:22,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:22,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599408779] [2022-11-23 14:26:22,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:22,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:22,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:22,098 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:22,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-23 14:26:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:22,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:26:22,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:22,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:26:22,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:22,502 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:22,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599408779] [2022-11-23 14:26:22,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599408779] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:26:22,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1269698640] [2022-11-23 14:26:22,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:22,503 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:26:22,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:26:22,518 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:26:22,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-23 14:26:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:22,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:26:22,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:22,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:26:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:23,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1269698640] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:26:23,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8063969] [2022-11-23 14:26:23,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:23,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:26:23,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:26:23,045 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:26:23,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 14:26:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:23,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:26:23,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:23,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:26:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:23,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8063969] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:26:23,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 14:26:23,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-23 14:26:23,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210822063] [2022-11-23 14:26:23,401 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 14:26:23,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 14:26:23,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:23,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 14:26:23,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:26:23,403 INFO L87 Difference]: Start difference. First operand 529 states and 564 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:26:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:23,646 INFO L93 Difference]: Finished difference Result 541 states and 581 transitions. [2022-11-23 14:26:23,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 14:26:23,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-11-23 14:26:23,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:23,650 INFO L225 Difference]: With dead ends: 541 [2022-11-23 14:26:23,650 INFO L226 Difference]: Without dead ends: 541 [2022-11-23 14:26:23,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-23 14:26:23,652 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 23 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:23,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1529 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:26:23,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-11-23 14:26:23,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2022-11-23 14:26:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 344 states have (on average 1.6046511627906976) internal successors, (552), 532 states have internal predecessors, (552), 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-11-23 14:26:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 579 transitions. [2022-11-23 14:26:23,666 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 579 transitions. Word has length 67 [2022-11-23 14:26:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:23,666 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 579 transitions. [2022-11-23 14:26:23,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:26:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 579 transitions. [2022-11-23 14:26:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-23 14:26:23,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:23,668 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:23,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-11-23 14:26:23,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-23 14:26:24,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-23 14:26:24,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 14:26:24,282 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:26:24,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:24,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1893632510, now seen corresponding path program 2 times [2022-11-23 14:26:24,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:24,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042748635] [2022-11-23 14:26:24,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:26:24,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:24,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:24,284 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:26:24,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-23 14:26:24,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 14:26:24,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:26:24,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 14:26:24,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:24,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:26:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:25,095 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:25,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042748635] [2022-11-23 14:26:25,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042748635] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:26:25,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [224715389] [2022-11-23 14:26:25,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:26:25,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:26:25,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:26:25,097 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:26:25,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-23 14:26:26,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 14:26:26,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:26:26,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 14:26:26,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:26,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:26:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:26,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [224715389] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:26:26,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977046624] [2022-11-23 14:26:26,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:26:26,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:26:26,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:26:26,596 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:26:26,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-23 14:26:55,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 14:26:55,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:26:55,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 14:26:55,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:55,848 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:26:55,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:26:55,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:26:56,540 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:26:56,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:26:56,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 14:26:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 14:26:56,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:26:56,914 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-23 14:26:56,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-23 14:26:57,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977046624] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:26:57,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-23 14:26:57,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-23 14:26:57,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039912876] [2022-11-23 14:26:57,069 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-23 14:26:57,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 14:26:57,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:57,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 14:26:57,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=552, Unknown=8, NotChecked=0, Total=650 [2022-11-23 14:26:57,071 INFO L87 Difference]: Start difference. First operand 539 states and 579 transitions. Second operand has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:27:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:08,255 INFO L93 Difference]: Finished difference Result 566 states and 614 transitions. [2022-11-23 14:27:08,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-23 14:27:08,257 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 70 [2022-11-23 14:27:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:08,258 INFO L225 Difference]: With dead ends: 566 [2022-11-23 14:27:08,258 INFO L226 Difference]: Without dead ends: 562 [2022-11-23 14:27:08,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=478, Invalid=2793, Unknown=35, NotChecked=0, Total=3306 [2022-11-23 14:27:08,261 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 924 mSDsluCounter, 2778 mSDsCounter, 0 mSdLazyCounter, 3556 mSolverCounterSat, 71 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 3633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3556 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:08,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 3045 Invalid, 3633 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [71 Valid, 3556 Invalid, 6 Unknown, 0 Unchecked, 9.0s Time] [2022-11-23 14:27:08,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-23 14:27:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 547. [2022-11-23 14:27:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 353 states have (on average 1.594900849858357) internal successors, (563), 540 states have internal predecessors, (563), 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-11-23 14:27:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 590 transitions. [2022-11-23 14:27:08,274 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 590 transitions. Word has length 70 [2022-11-23 14:27:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:08,274 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 590 transitions. [2022-11-23 14:27:08,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:27:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 590 transitions. [2022-11-23 14:27:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-23 14:27:08,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:08,276 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:27:08,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-23 14:27:08,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-23 14:27:08,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-23 14:27:08,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:27:08,883 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:27:08,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1191355359, now seen corresponding path program 1 times [2022-11-23 14:27:08,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:27:08,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478181403] [2022-11-23 14:27:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:08,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:27:08,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:27:08,885 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:27:08,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-23 14:27:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:09,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 14:27:09,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:09,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:27:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:10,292 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:27:10,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478181403] [2022-11-23 14:27:10,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478181403] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:27:10,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [976645526] [2022-11-23 14:27:10,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:10,293 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:27:10,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:27:10,302 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:27:10,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-23 14:27:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:10,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 14:27:10,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:10,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:27:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:11,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [976645526] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:27:11,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292992152] [2022-11-23 14:27:11,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:11,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:27:11,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:27:11,241 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:27:11,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-23 14:27:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:11,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 14:27:11,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:11,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:27:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:13,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292992152] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:27:13,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 14:27:13,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-11-23 14:27:13,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989620844] [2022-11-23 14:27:13,150 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 14:27:13,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 14:27:13,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:27:13,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 14:27:13,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 14:27:13,152 INFO L87 Difference]: Start difference. First operand 547 states and 590 transitions. Second operand has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 14:27:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:17,518 INFO L93 Difference]: Finished difference Result 589 states and 647 transitions. [2022-11-23 14:27:17,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-23 14:27:17,521 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2022-11-23 14:27:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:17,524 INFO L225 Difference]: With dead ends: 589 [2022-11-23 14:27:17,524 INFO L226 Difference]: Without dead ends: 583 [2022-11-23 14:27:17,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2022-11-23 14:27:17,526 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 223 mSDsluCounter, 6170 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 6688 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:17,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 6688 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 14:27:17,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-11-23 14:27:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 565. [2022-11-23 14:27:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 371 states have (on average 1.5795148247978437) internal successors, (586), 558 states have internal predecessors, (586), 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-11-23 14:27:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 613 transitions. [2022-11-23 14:27:17,549 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 613 transitions. Word has length 76 [2022-11-23 14:27:17,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:17,550 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 613 transitions. [2022-11-23 14:27:17,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 14:27:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 613 transitions. [2022-11-23 14:27:17,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-23 14:27:17,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:17,551 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:27:17,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-23 14:27:17,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-23 14:27:17,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-23 14:27:18,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:27:18,163 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:27:18,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:18,163 INFO L85 PathProgramCache]: Analyzing trace with hash -170909793, now seen corresponding path program 2 times [2022-11-23 14:27:18,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:27:18,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99290330] [2022-11-23 14:27:18,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:27:18,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:27:18,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:27:18,166 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:27:18,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-23 14:27:18,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 14:27:18,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:27:18,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-23 14:27:18,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:19,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:27:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:24,327 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:27:24,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99290330] [2022-11-23 14:27:24,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99290330] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:27:24,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1755135253] [2022-11-23 14:27:24,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:27:24,328 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:27:24,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:27:24,329 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:27:24,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-23 14:27:26,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 14:27:26,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:27:26,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-23 14:27:26,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:26,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:27:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:28,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1755135253] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:27:28,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424397272] [2022-11-23 14:27:28,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:27:28,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:27:28,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:27:28,221 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:27:28,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-23 14:27:40,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 14:27:40,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:27:40,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-23 14:27:40,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:40,910 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:27:40,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:27:40,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:27:41,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:27:41,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:27:41,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:27:41,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:27:42,048 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-11-23 14:27:42,244 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-11-23 14:27:42,261 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-11-23 14:27:42,276 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-11-23 14:27:42,291 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-11-23 14:27:42,306 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-11-23 14:27:42,322 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-11-23 14:27:42,337 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-11-23 14:27:42,356 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-11-23 14:27:42,372 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-11-23 14:27:42,393 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-11-23 14:27:42,410 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-11-23 14:27:42,424 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-11-23 14:27:42,439 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-11-23 14:27:42,454 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-11-23 14:27:42,469 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-11-23 14:27:42,484 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-11-23 14:27:42,499 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-11-23 14:27:42,514 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-11-23 14:27:42,529 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-11-23 14:27:42,582 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:27:42,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:27:42,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:27:42,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 14:27:42,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 14:27:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 250 not checked. [2022-11-23 14:27:43,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:27:44,269 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-11-23 14:27:44,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424397272] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:27:44,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-23 14:27:44,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 29] total 78 [2022-11-23 14:27:44,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215728488] [2022-11-23 14:27:44,279 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-23 14:27:44,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-23 14:27:44,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:27:44,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-23 14:27:44,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=738, Invalid=2837, Unknown=49, NotChecked=2856, Total=6480 [2022-11-23 14:27:44,283 INFO L87 Difference]: Start difference. First operand 565 states and 613 transitions. Second operand has 78 states, 77 states have (on average 2.4545454545454546) internal successors, (189), 78 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-11-23 14:28:05,256 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))) (exists ((v_ArrVal_2414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2414) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2413))) (exists ((v_ArrVal_2372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2372))) (exists ((v_ArrVal_2371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2371)))) is different from true [2022-11-23 14:28:07,260 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))) (exists ((v_ArrVal_2414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2414) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2413)))) is different from true [2022-11-23 14:28:50,512 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_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_2372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2372))) (exists ((v_ArrVal_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_2371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2371))) (exists ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2407))) (exists ((v_ArrVal_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-11-23 14:29:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:29:21,934 INFO L93 Difference]: Finished difference Result 1006 states and 1141 transitions. [2022-11-23 14:29:21,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-23 14:29:21,935 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 2.4545454545454546) internal successors, (189), 78 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-11-23 14:29:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:29:21,939 INFO L225 Difference]: With dead ends: 1006 [2022-11-23 14:29:21,939 INFO L226 Difference]: Without dead ends: 992 [2022-11-23 14:29:21,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 347 SyntacticMatches, 16 SemanticMatches, 167 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 4501 ImplicationChecksByTransitivity, 66.9s TimeCoverageRelationStatistics Valid=3438, Invalid=17236, Unknown=302, NotChecked=7416, Total=28392 [2022-11-23 14:29:21,947 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 2282 mSDsluCounter, 8121 mSDsCounter, 0 mSdLazyCounter, 12581 mSolverCounterSat, 422 mSolverCounterUnsat, 260 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 8411 SdHoareTripleChecker+Invalid, 26762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 12581 IncrementalHoareTripleChecker+Invalid, 260 IncrementalHoareTripleChecker+Unknown, 13499 IncrementalHoareTripleChecker+Unchecked, 37.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:29:21,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 8411 Invalid, 26762 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [422 Valid, 12581 Invalid, 260 Unknown, 13499 Unchecked, 37.0s Time] [2022-11-23 14:29:21,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-11-23 14:29:21,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 600. [2022-11-23 14:29:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 407 states have (on average 1.5454545454545454) internal successors, (629), 593 states have internal predecessors, (629), 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-11-23 14:29:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 656 transitions. [2022-11-23 14:29:21,972 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 656 transitions. Word has length 88 [2022-11-23 14:29:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:29:21,973 INFO L495 AbstractCegarLoop]: Abstraction has 600 states and 656 transitions. [2022-11-23 14:29:21,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 2.4545454545454546) internal successors, (189), 78 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-11-23 14:29:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 656 transitions. [2022-11-23 14:29:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-23 14:29:21,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:29:21,975 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:29:22,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-23 14:29:22,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-11-23 14:29:22,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-23 14:29:22,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:29:22,590 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:29:22,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:29:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1359083593, now seen corresponding path program 1 times [2022-11-23 14:29:22,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:29:22,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918430766] [2022-11-23 14:29:22,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:29:22,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:29:22,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:29:22,594 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:29:22,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-23 14:29:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:29:23,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-23 14:29:23,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:29:23,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:29:23,726 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 14:29:23,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 14:29:23,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:29:23,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 14:29:24,209 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_2830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2830)))) is different from true [2022-11-23 14:29:24,347 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_2834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2834)))) is different from true [2022-11-23 14:29:24,840 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_2846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2846) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 14:29:25,065 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_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2852)))) is different from true [2022-11-23 14:29:25,085 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_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 14:29:25,457 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_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_2862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2862)))) is different from true [2022-11-23 14:29:25,785 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:29:25,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:29:25,934 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:29:25,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:29:25,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 14:29:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2022-11-23 14:29:26,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:29:28,152 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2869 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 14:29:28,480 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-11-23 14:29:28,483 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:29:28,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918430766] [2022-11-23 14:29:28,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918430766] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:29:28,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1805447450] [2022-11-23 14:29:28,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:29:28,484 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:29:28,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:29:28,485 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:29:28,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-23 14:29:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:29:32,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-23 14:29:32,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:29:32,732 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:29:32,732 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-11-23 14:29:33,153 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-23 14:29:33,153 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-11-23 14:29:33,250 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-11-23 14:29:33,625 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-11-23 14:29:38,028 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:29:38,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:29:38,313 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:29:38,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:29:38,362 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-11-23 14:29:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-23 14:29:38,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:29:38,484 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-11-23 14:29:40,987 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-11-23 14:29:40,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1805447450] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:29:40,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885661710] [2022-11-23 14:29:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:29:40,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:29:40,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:29:40,992 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:29:40,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-23 14:29:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:29:41,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-23 14:29:41,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:29:41,842 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:29:41,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:29:41,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:29:42,119 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-11-23 14:29:42,125 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-11-23 14:29:42,131 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-11-23 14:29:42,137 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-11-23 14:29:42,151 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-11-23 14:29:42,158 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-11-23 14:29:42,165 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-11-23 14:29:42,172 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-11-23 14:29:42,179 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-11-23 14:29:42,187 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-11-23 14:29:42,195 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-11-23 14:29:42,202 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-11-23 14:29:42,210 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-11-23 14:29:42,217 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-11-23 14:29:42,224 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-11-23 14:29:42,232 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-11-23 14:29:42,239 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-11-23 14:29:42,246 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-11-23 14:29:42,253 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-11-23 14:29:42,261 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-11-23 14:29:42,269 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-11-23 14:29:42,276 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-11-23 14:29:42,283 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-11-23 14:29:42,290 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-11-23 14:29:42,298 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-11-23 14:29:42,305 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-11-23 14:29:42,312 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-11-23 14:29:42,319 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-11-23 14:29:42,327 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-11-23 14:29:42,334 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-11-23 14:29:42,341 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-11-23 14:29:42,348 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-11-23 14:29:42,355 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-11-23 14:29:42,362 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-11-23 14:29:42,369 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-11-23 14:29:42,377 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-11-23 14:29:42,383 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-11-23 14:29:42,391 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-11-23 14:29:42,399 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-11-23 14:29:42,406 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-11-23 14:29:42,413 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-11-23 14:29:42,420 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-11-23 14:29:42,426 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-11-23 14:29:42,433 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-11-23 14:29:42,461 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:29:42,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-23 14:29:42,580 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:29:42,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:29:44,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 14:29:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-23 14:29:44,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:29:44,735 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-23 14:29:44,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-23 14:29:44,745 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem35#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3773) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2022-11-23 14:29:44,759 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3773 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-23 14:29:45,142 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3819 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3819)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2022-11-23 14:29:45,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885661710] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:29:45,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:29:45,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 54] total 76 [2022-11-23 14:29:45,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881431225] [2022-11-23 14:29:45,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:29:45,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-23 14:29:45,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:29:45,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-23 14:29:45,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=754, Unknown=98, NotChecked=6384, Total=7482 [2022-11-23 14:29:45,150 INFO L87 Difference]: Start difference. First operand 600 states and 656 transitions. Second operand has 77 states, 73 states have (on average 3.2054794520547945) internal successors, (234), 77 states have internal predecessors, (234), 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-11-23 14:29:57,531 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2825) |c_#memory_$Pointer$.base|)) (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))) (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|))))) is different from true [2022-11-23 14:30:00,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:30:00,595 INFO L93 Difference]: Finished difference Result 1127 states and 1261 transitions. [2022-11-23 14:30:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-23 14:30:00,596 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 73 states have (on average 3.2054794520547945) internal successors, (234), 77 states have internal predecessors, (234), 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-11-23 14:30:00,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:30:00,600 INFO L225 Difference]: With dead ends: 1127 [2022-11-23 14:30:00,600 INFO L226 Difference]: Without dead ends: 1127 [2022-11-23 14:30:00,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 190 SyntacticMatches, 87 SemanticMatches, 104 ConstructedPredicates, 58 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=471, Invalid=1876, Unknown=141, NotChecked=8642, Total=11130 [2022-11-23 14:30:00,606 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 1648 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 3186 mSolverCounterSat, 76 mSolverCounterUnsat, 926 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 54139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 3186 IncrementalHoareTripleChecker+Invalid, 926 IncrementalHoareTripleChecker+Unknown, 49951 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:30:00,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1668 Valid, 2763 Invalid, 54139 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [76 Valid, 3186 Invalid, 926 Unknown, 49951 Unchecked, 13.8s Time] [2022-11-23 14:30:00,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-11-23 14:30:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 599. [2022-11-23 14:30:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 407 states have (on average 1.542997542997543) internal successors, (628), 592 states have internal predecessors, (628), 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-11-23 14:30:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 655 transitions. [2022-11-23 14:30:00,627 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 655 transitions. Word has length 113 [2022-11-23 14:30:00,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:30:00,627 INFO L495 AbstractCegarLoop]: Abstraction has 599 states and 655 transitions. [2022-11-23 14:30:00,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 73 states have (on average 3.2054794520547945) internal successors, (234), 77 states have internal predecessors, (234), 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-11-23 14:30:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 655 transitions. [2022-11-23 14:30:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-23 14:30:00,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:30:00,632 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:30:00,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-23 14:30:00,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-23 14:30:01,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-23 14:30:01,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:30:01,247 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-23 14:30:01,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:30:01,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1359083592, now seen corresponding path program 1 times [2022-11-23 14:30:01,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:30:01,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961744433] [2022-11-23 14:30:01,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:30:01,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:30:01,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:30:01,250 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:30:01,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-23 14:30:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:30:02,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-23 14:30:02,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:30:02,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:30:02,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:30:02,489 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:30:02,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:30:02,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:30:02,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:30:02,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:30:02,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:30:02,826 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-11-23 14:30:02,886 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-11-23 14:30:02,944 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_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194)))) is different from true [2022-11-23 14:30:03,055 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-11-23 14:30:03,113 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-11-23 14:30:03,129 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-11-23 14:30:03,146 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-11-23 14:30:03,162 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4210))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 14:30:03,267 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 14:30:03,284 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-11-23 14:30:03,300 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32)))) is different from true [2022-11-23 14:30:03,317 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-11-23 14:30:03,334 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_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224)))) is different from true [2022-11-23 14:30:03,351 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-11-23 14:30:03,368 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_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229)))) is different from true [2022-11-23 14:30:03,402 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-11-23 14:30:03,420 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-11-23 14:30:03,440 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-11-23 14:30:03,456 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-11-23 14:30:03,472 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-11-23 14:30:03,487 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-11-23 14:30:03,504 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-11-23 14:30:03,519 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-11-23 14:30:03,536 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-11-23 14:30:03,552 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-11-23 14:30:03,569 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-11-23 14:30:03,585 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-11-23 14:30:03,601 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-11-23 14:30:03,618 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-11-23 14:30:03,634 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-11-23 14:30:03,650 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_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-11-23 14:30:03,667 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-11-23 14:30:03,683 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-11-23 14:30:03,699 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-11-23 14:30:03,716 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-11-23 14:30:03,732 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-11-23 14:30:03,800 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:30:03,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:30:03,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:30:03,985 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:30:03,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:30:04,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:30:04,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 14:30:04,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 14:30:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 954 not checked. [2022-11-23 14:30:04,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:30:04,339 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-11-23 14:30:04,420 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-11-23 14:30:05,627 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-11-23 14:30:05,638 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:30:05,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961744433] [2022-11-23 14:30:05,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961744433] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:30:05,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1100953748] [2022-11-23 14:30:05,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:30:05,639 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:30:05,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:30:05,641 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:30:05,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-23 14:32:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:15,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-23 14:32:15,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:32:15,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:32:16,036 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:32:16,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:32:16,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:32:16,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:32:16,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:32:16,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 22 treesize of output 10 [2022-11-23 14:32:16,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:32:16,250 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-11-23 14:32:16,268 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-11-23 14:32:16,283 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-11-23 14:32:16,305 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-11-23 14:32:16,321 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-11-23 14:32:16,337 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-11-23 14:32:16,352 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-11-23 14:32:16,368 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-11-23 14:32:16,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_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-11-23 14:32:16,402 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-11-23 14:32:16,427 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_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-11-23 14:32:16,443 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-11-23 14:32:16,459 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_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-11-23 14:32:16,474 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-11-23 14:32:16,491 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-11-23 14:32:16,506 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-11-23 14:32:16,523 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-11-23 14:32:16,542 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-11-23 14:32:16,560 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-11-23 14:32:16,579 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-11-23 14:32:16,597 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-11-23 14:32:16,615 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-11-23 14:32:16,632 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-11-23 14:32:16,651 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-11-23 14:32:16,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_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-11-23 14:32:16,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_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-11-23 14:32:16,702 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_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-11-23 14:32:16,717 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_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-11-23 14:32:16,733 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_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-11-23 14:32:16,748 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-11-23 14:32:16,764 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-11-23 14:32:16,779 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-11-23 14:32:16,802 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-11-23 14:32:16,820 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-11-23 14:32:16,836 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-11-23 14:32:16,850 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-11-23 14:32:16,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_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-11-23 14:32:16,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_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-11-23 14:32:16,898 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-11-23 14:32:16,914 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-11-23 14:32:16,933 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-11-23 14:32:16,949 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_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-11-23 14:32:16,968 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-11-23 14:32:16,986 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_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-11-23 14:32:17,054 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:32:17,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:32:17,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:32:17,176 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:32:17,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:32:17,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:32:17,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 14:32:17,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 14:32:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-23 14:32:17,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:32:17,339 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-11-23 14:32:17,382 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-11-23 14:32:18,485 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-11-23 14:32:18,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1100953748] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:32:18,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496405535] [2022-11-23 14:32:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:18,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:32:18,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:32:18,497 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:32:18,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab18e097-65b2-4147-a056-d8a7cd0191c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-23 14:32:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:19,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-23 14:32:19,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:32:19,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:32:19,406 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:32:19,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:32:19,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:32:19,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:32:19,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:32:19,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:32:19,584 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_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-11-23 14:32:19,599 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_5278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5278))) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277)))) is different from true [2022-11-23 14:32:19,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_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-11-23 14:32:19,630 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-11-23 14:32:19,645 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-11-23 14:32:19,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_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-11-23 14:32:19,676 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_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-11-23 14:32:19,691 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-11-23 14:32:19,705 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-11-23 14:32:19,720 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-11-23 14:32:19,735 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-11-23 14:32:19,750 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-11-23 14:32:19,765 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-11-23 14:32:19,780 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_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-11-23 14:32:19,795 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_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-11-23 14:32:19,810 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-11-23 14:32:19,826 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-11-23 14:32:19,841 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-11-23 14:32:19,880 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-11-23 14:32:19,898 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-11-23 14:32:19,916 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-11-23 14:32:19,934 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-11-23 14:32:19,952 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-11-23 14:32:19,971 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-11-23 14:32:19,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_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-11-23 14:32:20,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_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-11-23 14:32:20,024 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-11-23 14:32:20,042 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-11-23 14:32:20,059 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-11-23 14:32:20,077 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-11-23 14:32:20,095 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-11-23 14:32:20,110 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-11-23 14:32:20,125 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-11-23 14:32:20,140 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-11-23 14:32:20,156 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-11-23 14:32:20,171 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-11-23 14:32:20,187 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-11-23 14:32:20,203 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-11-23 14:32:20,220 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-11-23 14:32:20,235 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-11-23 14:32:20,254 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-11-23 14:32:20,272 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-11-23 14:32:20,288 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-11-23 14:32:20,304 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-11-23 14:32:20,372 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:32:20,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:32:20,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:32:20,476 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:32:20,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:32:20,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:32:20,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 14:32:20,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 14:32:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-23 14:32:20,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:32:20,607 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-11-23 14:32:20,650 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-11-23 14:32:21,915 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-11-23 14:32:21,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496405535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:32:21,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:32:21,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 52, 53] total 134 [2022-11-23 14:32:21,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928743068] [2022-11-23 14:32:21,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:32:21,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 135 states [2022-11-23 14:32:21,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:32:21,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2022-11-23 14:32:21,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=252, Unknown=141, NotChecked=20482, Total=21170 [2022-11-23 14:32:21,935 INFO L87 Difference]: Start difference. First operand 599 states and 655 transitions. Second operand has 135 states, 133 states have (on average 1.7067669172932332) internal successors, (227), 135 states have internal predecessors, (227), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 14:32:23,492 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_5278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5278))) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (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_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (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_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_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))) (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_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_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_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))) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.base|)) (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_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))) (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))) (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-11-23 14:32:23,500 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_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_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (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_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_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_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|)) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_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_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_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_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_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))) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.base|)) (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_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))) (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))) (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))) (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))) (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-11-23 14:32:23,508 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_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_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_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (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_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_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_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_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|)) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_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_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_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))) (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|)) (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))) (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_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.base|)) (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_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))) (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|)) (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))) (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))) (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-11-23 14:32:23,516 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4210))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_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_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_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (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_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_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_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|)) (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_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_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_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_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))) (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_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (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_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_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|)) (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))) (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))) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.base|)) (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_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))) (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))) (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))) (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))) (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-11-23 14:32:23,526 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4210))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_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_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_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (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_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_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_ArrVal_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_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|)) (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_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_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_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_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))) (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_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_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))) (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))) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.base|)) (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_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|)) (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))) (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))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225) |c_#memory_$Pointer$.offset|)) (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))) (exists ((v_ArrVal_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224))) (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-11-23 14:32:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:32:32,291 INFO L93 Difference]: Finished difference Result 620 states and 682 transitions. [2022-11-23 14:32:32,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 14:32:32,292 INFO L78 Accepts]: Start accepts. Automaton has has 135 states, 133 states have (on average 1.7067669172932332) internal successors, (227), 135 states have internal predecessors, (227), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 113 [2022-11-23 14:32:32,292 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-11-23 14:32:32,292 INFO L78 Accepts]: Start accepts. Automaton has has 135 states, 133 states have (on average 1.7067669172932332) internal successors, (227), 135 states have internal predecessors, (227), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 113