./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:48:45,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:48:45,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:48:45,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:48:45,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:48:45,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:48:45,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:48:45,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:48:45,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:48:45,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:48:45,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:48:45,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:48:45,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:48:45,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:48:45,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:48:45,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:48:45,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:48:45,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:48:45,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:48:45,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:48:45,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:48:45,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:48:45,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:48:45,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:48:45,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:48:45,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:48:45,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:48:45,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:48:45,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:48:45,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:48:45,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:48:45,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:48:45,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:48:45,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:48:45,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:48:45,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:48:45,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:48:45,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:48:45,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:48:45,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:48:45,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:48:45,140 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:48:45,176 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:48:45,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:48:45,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:48:45,178 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:48:45,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:48:45,179 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:48:45,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:48:45,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:48:45,180 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:48:45,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:48:45,181 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:48:45,181 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:48:45,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:48:45,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:48:45,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:48:45,182 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:48:45,182 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:48:45,183 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:48:45,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:48:45,183 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:48:45,183 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:48:45,183 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:48:45,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:48:45,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:48:45,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:48:45,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:48:45,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:48:45,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:48:45,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:48:45,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:48:45,187 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_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/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_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc 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 -> Automizer 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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2022-11-02 20:48:45,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:48:45,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:48:45,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:48:45,555 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:48:45,555 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:48:45,557 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2022-11-02 20:48:45,624 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/data/fc4eb9be2/22f0c79d88064d59bb61d99a23c1ffd9/FLAGb87a82b49 [2022-11-02 20:48:46,380 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:48:46,381 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2022-11-02 20:48:46,409 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/data/fc4eb9be2/22f0c79d88064d59bb61d99a23c1ffd9/FLAGb87a82b49 [2022-11-02 20:48:46,488 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/data/fc4eb9be2/22f0c79d88064d59bb61d99a23c1ffd9 [2022-11-02 20:48:46,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:48:46,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:48:46,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:48:46,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:48:46,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:48:46,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:48:46" (1/1) ... [2022-11-02 20:48:46,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac3c772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:46, skipping insertion in model container [2022-11-02 20:48:46,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:48:46" (1/1) ... [2022-11-02 20:48:46,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:48:46,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:48:47,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i[33021,33034] [2022-11-02 20:48:47,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i[84583,84596] [2022-11-02 20:48:47,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:48:47,438 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-02 20:48:47,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@34a9f132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:47, skipping insertion in model container [2022-11-02 20:48:47,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:48:47,439 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-02 20:48:47,441 INFO L158 Benchmark]: Toolchain (without parser) took 944.56ms. Allocated memory is still 96.5MB. Free memory was 72.5MB in the beginning and 50.0MB in the end (delta: 22.5MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2022-11-02 20:48:47,441 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 96.5MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:48:47,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 940.61ms. Allocated memory is still 96.5MB. Free memory was 72.5MB in the beginning and 50.0MB in the end (delta: 22.5MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2022-11-02 20:48:47,444 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.25ms. Allocated memory is still 96.5MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 940.61ms. Allocated memory is still 96.5MB. Free memory was 72.5MB in the beginning and 50.0MB in the end (delta: 22.5MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:48:49,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:48:49,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:48:49,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:48:49,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:48:49,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:48:49,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:48:49,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:48:49,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:48:49,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:48:49,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:48:49,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:48:49,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:48:49,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:48:49,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:48:49,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:48:49,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:48:49,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:48:49,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:48:49,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:48:49,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:48:49,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:48:49,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:48:49,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:48:49,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:48:49,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:48:49,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:48:49,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:48:49,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:48:49,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:48:49,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:48:49,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:48:49,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:48:49,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:48:49,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:48:49,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:48:49,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:48:49,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:48:49,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:48:49,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:48:49,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:48:49,686 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-02 20:48:49,718 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:48:49,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:48:49,719 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:48:49,719 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:48:49,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:48:49,721 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:48:49,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:48:49,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:48:49,723 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:48:49,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:48:49,725 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:48:49,725 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:48:49,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:48:49,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:48:49,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:48:49,726 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:48:49,727 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:48:49,727 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:48:49,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:48:49,727 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:48:49,728 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-02 20:48:49,728 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-02 20:48:49,728 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:48:49,729 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:48:49,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:48:49,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:48:49,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:48:49,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:48:49,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:48:49,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:48:49,731 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-02 20:48:49,731 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-02 20:48:49,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-02 20:48:49,732 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_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/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_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc 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 -> Automizer 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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2022-11-02 20:48:50,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:48:50,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:48:50,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:48:50,127 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:48:50,128 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:48:50,129 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2022-11-02 20:48:50,209 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/data/89d7a697a/49b83479c0e64fd3bd89927a2a5d6591/FLAGc4391c704 [2022-11-02 20:48:50,958 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:48:50,959 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2022-11-02 20:48:50,981 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/data/89d7a697a/49b83479c0e64fd3bd89927a2a5d6591/FLAGc4391c704 [2022-11-02 20:48:51,105 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/data/89d7a697a/49b83479c0e64fd3bd89927a2a5d6591 [2022-11-02 20:48:51,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:48:51,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:48:51,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:48:51,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:48:51,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:48:51,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:48:51" (1/1) ... [2022-11-02 20:48:51,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345f4349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:51, skipping insertion in model container [2022-11-02 20:48:51,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:48:51" (1/1) ... [2022-11-02 20:48:51,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:48:51,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:48:51,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i[33021,33034] [2022-11-02 20:48:52,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i[84583,84596] [2022-11-02 20:48:52,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:48:52,152 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-02 20:48:52,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:48:52,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i[33021,33034] [2022-11-02 20:48:52,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i[84583,84596] [2022-11-02 20:48:52,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:48:52,413 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:48:52,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i[33021,33034] [2022-11-02 20:48:52,594 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i[84583,84596] [2022-11-02 20:48:52,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:48:52,648 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:48:52,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:52 WrapperNode [2022-11-02 20:48:52,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:48:52,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:48:52,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:48:52,651 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:48:52,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:52" (1/1) ... [2022-11-02 20:48:52,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:52" (1/1) ... [2022-11-02 20:48:52,819 INFO L138 Inliner]: procedures = 180, calls = 781, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3034 [2022-11-02 20:48:52,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:48:52,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:48:52,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:48:52,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:48:52,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:52" (1/1) ... [2022-11-02 20:48:52,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:52" (1/1) ... [2022-11-02 20:48:52,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:52" (1/1) ... [2022-11-02 20:48:52,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:52" (1/1) ... [2022-11-02 20:48:52,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:52" (1/1) ... [2022-11-02 20:48:52,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:52" (1/1) ... [2022-11-02 20:48:53,011 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:52" (1/1) ... [2022-11-02 20:48:53,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:52" (1/1) ... [2022-11-02 20:48:53,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:48:53,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:48:53,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:48:53,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:48:53,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:52" (1/1) ... [2022-11-02 20:48:53,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:48:53,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:53,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:48:53,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:48:53,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-02 20:48:53,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-02 20:48:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-02 20:48:53,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-02 20:48:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 20:48:53,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 20:48:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:48:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:48:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:48:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:48:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-02 20:48:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:48:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:48:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-02 20:48:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-02 20:48:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:48:53,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:48:53,427 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:48:53,429 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:48:53,433 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:49:00,273 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:49:00,302 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:49:00,302 INFO L300 CfgBuilder]: Removed 63 assume(true) statements. [2022-11-02 20:49:00,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:00 BoogieIcfgContainer [2022-11-02 20:49:00,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:49:00,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:49:00,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:49:00,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:49:00,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:48:51" (1/3) ... [2022-11-02 20:49:00,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a230a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:00, skipping insertion in model container [2022-11-02 20:49:00,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:52" (2/3) ... [2022-11-02 20:49:00,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a230a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:00, skipping insertion in model container [2022-11-02 20:49:00,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:00" (3/3) ... [2022-11-02 20:49:00,321 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-2.i [2022-11-02 20:49:00,340 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:49:00,341 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 536 error locations. [2022-11-02 20:49:00,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:49:00,441 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;@6179821f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:49:00,442 INFO L358 AbstractCegarLoop]: Starting to check reachability of 536 error locations. [2022-11-02 20:49:00,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 2071 states, 1032 states have (on average 2.123062015503876) internal successors, (2191), 2065 states have internal predecessors, (2191), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-11-02 20:49:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:49:00,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:00,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:49:00,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:00,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2022-11-02 20:49:00,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:00,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405408743] [2022-11-02 20:49:00,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:00,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:00,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:00,486 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:00,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-02 20:49:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:49:00,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:00,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:49:00,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-02 20:49:00,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:00,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:00,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405408743] [2022-11-02 20:49:00,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405408743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:00,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:00,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:49:00,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808712598] [2022-11-02 20:49:00,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:00,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:00,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:00,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:00,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:00,908 INFO L87 Difference]: Start difference. First operand has 2071 states, 1032 states have (on average 2.123062015503876) internal successors, (2191), 2065 states have internal predecessors, (2191), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:04,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:04,271 INFO L93 Difference]: Finished difference Result 2235 states and 3301 transitions. [2022-11-02 20:49:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:04,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:49:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:04,315 INFO L225 Difference]: With dead ends: 2235 [2022-11-02 20:49:04,315 INFO L226 Difference]: Without dead ends: 2233 [2022-11-02 20:49:04,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:04,320 INFO L413 NwaCegarLoop]: 2636 mSDtfsCounter, 1985 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2488 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:04,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2488 Valid, 2785 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-02 20:49:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2022-11-02 20:49:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2055. [2022-11-02 20:49:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1032 states have (on average 2.0416666666666665) internal successors, (2107), 2049 states have internal predecessors, (2107), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-11-02 20:49:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3113 transitions. [2022-11-02 20:49:04,733 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3113 transitions. Word has length 3 [2022-11-02 20:49:04,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:04,734 INFO L495 AbstractCegarLoop]: Abstraction has 2055 states and 3113 transitions. [2022-11-02 20:49:04,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:04,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3113 transitions. [2022-11-02 20:49:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:49:04,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:04,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:49:04,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:04,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:04,947 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:04,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:04,948 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2022-11-02 20:49:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:04,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854206534] [2022-11-02 20:49:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:04,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:04,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:04,951 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:04,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-02 20:49:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:05,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:49:05,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:05,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:49:05,112 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-02 20:49:05,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:05,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:05,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854206534] [2022-11-02 20:49:05,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854206534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:05,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:05,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:49:05,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686349746] [2022-11-02 20:49:05,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:05,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:05,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:05,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:05,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:05,117 INFO L87 Difference]: Start difference. First operand 2055 states and 3113 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:09,613 INFO L93 Difference]: Finished difference Result 3463 states and 5553 transitions. [2022-11-02 20:49:09,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:09,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:49:09,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:09,631 INFO L225 Difference]: With dead ends: 3463 [2022-11-02 20:49:09,632 INFO L226 Difference]: Without dead ends: 3463 [2022-11-02 20:49:09,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:09,633 INFO L413 NwaCegarLoop]: 3417 mSDtfsCounter, 1440 mSDsluCounter, 2083 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:09,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1940 Valid, 5500 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-02 20:49:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2022-11-02 20:49:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3177. [2022-11-02 20:49:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 1655 states have (on average 2.015105740181269) internal successors, (3335), 3171 states have internal predecessors, (3335), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-11-02 20:49:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 5341 transitions. [2022-11-02 20:49:10,086 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 5341 transitions. Word has length 3 [2022-11-02 20:49:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:10,087 INFO L495 AbstractCegarLoop]: Abstraction has 3177 states and 5341 transitions. [2022-11-02 20:49:10,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 5341 transitions. [2022-11-02 20:49:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:49:10,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:10,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:10,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-02 20:49:10,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:10,299 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:10,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:10,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1466973012, now seen corresponding path program 1 times [2022-11-02 20:49:10,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:10,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664596153] [2022-11-02 20:49:10,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:10,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:10,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:10,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:10,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-02 20:49:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:10,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:49:10,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:10,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:49:10,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:49:10,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:10,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:49:10,567 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:49:10,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-02 20:49:10,591 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-02 20:49:10,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:10,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:10,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664596153] [2022-11-02 20:49:10,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664596153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:10,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:10,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:10,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763337930] [2022-11-02 20:49:10,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:10,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:49:10,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:10,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:49:10,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:49:10,594 INFO L87 Difference]: Start difference. First operand 3177 states and 5341 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:16,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:16,529 INFO L93 Difference]: Finished difference Result 3344 states and 5516 transitions. [2022-11-02 20:49:16,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:49:16,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-02 20:49:16,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:16,546 INFO L225 Difference]: With dead ends: 3344 [2022-11-02 20:49:16,546 INFO L226 Difference]: Without dead ends: 3344 [2022-11-02 20:49:16,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:49:16,548 INFO L413 NwaCegarLoop]: 2363 mSDtfsCounter, 4223 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4726 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:16,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4726 Valid, 2444 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-02 20:49:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3344 states. [2022-11-02 20:49:16,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3344 to 2044. [2022-11-02 20:49:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1032 states have (on average 2.0300387596899223) internal successors, (2095), 2038 states have internal predecessors, (2095), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-11-02 20:49:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3101 transitions. [2022-11-02 20:49:16,850 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3101 transitions. Word has length 7 [2022-11-02 20:49:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:16,850 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 3101 transitions. [2022-11-02 20:49:16,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3101 transitions. [2022-11-02 20:49:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:49:16,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:16,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:16,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:17,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:17,064 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:17,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:17,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476910, now seen corresponding path program 1 times [2022-11-02 20:49:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:17,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807495164] [2022-11-02 20:49:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:17,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:17,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:17,067 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:17,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-02 20:49:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:17,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:49:17,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:17,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:49:17,227 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-02 20:49:17,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:17,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:17,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807495164] [2022-11-02 20:49:17,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807495164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:17,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:17,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:49:17,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827982036] [2022-11-02 20:49:17,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:17,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:17,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:17,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:17,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:17,230 INFO L87 Difference]: Start difference. First operand 2044 states and 3101 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:20,257 INFO L93 Difference]: Finished difference Result 3210 states and 5288 transitions. [2022-11-02 20:49:20,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:20,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-02 20:49:20,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:20,276 INFO L225 Difference]: With dead ends: 3210 [2022-11-02 20:49:20,277 INFO L226 Difference]: Without dead ends: 3210 [2022-11-02 20:49:20,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:20,278 INFO L413 NwaCegarLoop]: 4866 mSDtfsCounter, 1804 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2307 SdHoareTripleChecker+Valid, 7123 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:20,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2307 Valid, 7123 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-02 20:49:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2022-11-02 20:49:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 1997. [2022-11-02 20:49:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1032 states have (on average 1.9844961240310077) internal successors, (2048), 1991 states have internal predecessors, (2048), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-11-02 20:49:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 3054 transitions. [2022-11-02 20:49:20,544 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 3054 transitions. Word has length 8 [2022-11-02 20:49:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:20,545 INFO L495 AbstractCegarLoop]: Abstraction has 1997 states and 3054 transitions. [2022-11-02 20:49:20,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 3054 transitions. [2022-11-02 20:49:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:49:20,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:20,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:20,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:20,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:20,758 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476909, now seen corresponding path program 1 times [2022-11-02 20:49:20,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:20,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214049081] [2022-11-02 20:49:20,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:20,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:20,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:20,761 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:20,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-02 20:49:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:20,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:49:20,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:20,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:49:20,941 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-02 20:49:20,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:20,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:20,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214049081] [2022-11-02 20:49:20,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214049081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:20,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:20,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:49:20,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596817825] [2022-11-02 20:49:20,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:20,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:20,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:20,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:20,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:20,944 INFO L87 Difference]: Start difference. First operand 1997 states and 3054 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:24,648 INFO L93 Difference]: Finished difference Result 3275 states and 5356 transitions. [2022-11-02 20:49:24,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:24,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-02 20:49:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:24,662 INFO L225 Difference]: With dead ends: 3275 [2022-11-02 20:49:24,663 INFO L226 Difference]: Without dead ends: 3275 [2022-11-02 20:49:24,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:24,664 INFO L413 NwaCegarLoop]: 5058 mSDtfsCounter, 1489 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1989 SdHoareTripleChecker+Valid, 7481 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:24,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1989 Valid, 7481 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-02 20:49:24,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2022-11-02 20:49:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 2019. [2022-11-02 20:49:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 1064 states have (on average 1.9774436090225564) internal successors, (2104), 2013 states have internal predecessors, (2104), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-11-02 20:49:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 3110 transitions. [2022-11-02 20:49:24,944 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 3110 transitions. Word has length 8 [2022-11-02 20:49:24,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:24,945 INFO L495 AbstractCegarLoop]: Abstraction has 2019 states and 3110 transitions. [2022-11-02 20:49:24,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 3110 transitions. [2022-11-02 20:49:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:49:24,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:24,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:24,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:25,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:25,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr429REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:25,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:25,159 INFO L85 PathProgramCache]: Analyzing trace with hash 874110197, now seen corresponding path program 1 times [2022-11-02 20:49:25,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:25,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673569319] [2022-11-02 20:49:25,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:25,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:25,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:25,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:25,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-02 20:49:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:25,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:49:25,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:25,376 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-02 20:49:25,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:25,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:25,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673569319] [2022-11-02 20:49:25,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673569319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:25,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:25,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:25,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377908861] [2022-11-02 20:49:25,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:25,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:25,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:25,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:25,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:25,384 INFO L87 Difference]: Start difference. First operand 2019 states and 3110 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-02 20:49:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:25,755 INFO L93 Difference]: Finished difference Result 3486 states and 5612 transitions. [2022-11-02 20:49:25,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:25,756 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-02 20:49:25,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:25,770 INFO L225 Difference]: With dead ends: 3486 [2022-11-02 20:49:25,770 INFO L226 Difference]: Without dead ends: 3486 [2022-11-02 20:49:25,771 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-02 20:49:25,773 INFO L413 NwaCegarLoop]: 3606 mSDtfsCounter, 1560 mSDsluCounter, 2887 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 6493 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:25,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2062 Valid, 6493 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:49:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2022-11-02 20:49:26,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3193. [2022-11-02 20:49:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 1738 states have (on average 1.9568469505178365) internal successors, (3401), 3187 states have internal predecessors, (3401), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-11-02 20:49:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 5407 transitions. [2022-11-02 20:49:26,069 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 5407 transitions. Word has length 11 [2022-11-02 20:49:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:26,069 INFO L495 AbstractCegarLoop]: Abstraction has 3193 states and 5407 transitions. [2022-11-02 20:49:26,070 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-02 20:49:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 5407 transitions. [2022-11-02 20:49:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:49:26,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:26,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:26,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:26,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:26,282 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:26,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:26,283 INFO L85 PathProgramCache]: Analyzing trace with hash -702153283, now seen corresponding path program 1 times [2022-11-02 20:49:26,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:26,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092605809] [2022-11-02 20:49:26,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:26,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:26,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:26,285 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:26,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-02 20:49:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:26,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:49:26,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:26,469 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-02 20:49:26,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:26,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:26,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092605809] [2022-11-02 20:49:26,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092605809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:26,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:26,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:26,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063221312] [2022-11-02 20:49:26,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:26,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:26,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:26,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:26,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:26,477 INFO L87 Difference]: Start difference. First operand 3193 states and 5407 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-02 20:49:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:26,532 INFO L93 Difference]: Finished difference Result 3347 states and 5547 transitions. [2022-11-02 20:49:26,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:26,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-02 20:49:26,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:26,548 INFO L225 Difference]: With dead ends: 3347 [2022-11-02 20:49:26,549 INFO L226 Difference]: Without dead ends: 3347 [2022-11-02 20:49:26,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-02 20:49:26,550 INFO L413 NwaCegarLoop]: 3202 mSDtfsCounter, 1394 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1894 SdHoareTripleChecker+Valid, 4519 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-02 20:49:26,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1894 Valid, 4519 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:49:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2022-11-02 20:49:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 3133. [2022-11-02 20:49:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 1702 states have (on average 1.9477085781433607) internal successors, (3315), 3127 states have internal predecessors, (3315), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-11-02 20:49:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 5321 transitions. [2022-11-02 20:49:26,824 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 5321 transitions. Word has length 13 [2022-11-02 20:49:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:26,825 INFO L495 AbstractCegarLoop]: Abstraction has 3133 states and 5321 transitions. [2022-11-02 20:49:26,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-02 20:49:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 5321 transitions. [2022-11-02 20:49:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:49:26,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:26,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:26,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:27,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:27,038 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr534ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:27,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:27,039 INFO L85 PathProgramCache]: Analyzing trace with hash 240246254, now seen corresponding path program 1 times [2022-11-02 20:49:27,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:27,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744515130] [2022-11-02 20:49:27,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:27,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:27,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:27,041 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:27,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-02 20:49:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:27,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:49:27,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:27,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:49:27,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:49:27,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2022-11-02 20:49:27,287 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:27,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2022-11-02 20:49:27,311 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-02 20:49:27,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:27,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:27,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744515130] [2022-11-02 20:49:27,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744515130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:27,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:27,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:49:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207000185] [2022-11-02 20:49:27,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:27,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:49:27,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:27,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:49:27,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:49:27,314 INFO L87 Difference]: Start difference. First operand 3133 states and 5321 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-02 20:49:30,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:30,864 INFO L93 Difference]: Finished difference Result 5450 states and 9669 transitions. [2022-11-02 20:49:30,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:49:30,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-11-02 20:49:30,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:30,888 INFO L225 Difference]: With dead ends: 5450 [2022-11-02 20:49:30,888 INFO L226 Difference]: Without dead ends: 5450 [2022-11-02 20:49:30,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:49:30,889 INFO L413 NwaCegarLoop]: 3461 mSDtfsCounter, 1330 mSDsluCounter, 5812 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1830 SdHoareTripleChecker+Valid, 9273 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:30,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1830 Valid, 9273 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 674 Invalid, 0 Unknown, 37 Unchecked, 3.4s Time] [2022-11-02 20:49:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5450 states. [2022-11-02 20:49:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5450 to 3132. [2022-11-02 20:49:31,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 1701 states have (on average 1.9476778365667256) internal successors, (3313), 3126 states have internal predecessors, (3313), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-11-02 20:49:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 5319 transitions. [2022-11-02 20:49:31,385 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 5319 transitions. Word has length 14 [2022-11-02 20:49:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:31,385 INFO L495 AbstractCegarLoop]: Abstraction has 3132 states and 5319 transitions. [2022-11-02 20:49:31,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-02 20:49:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 5319 transitions. [2022-11-02 20:49:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:49:31,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:31,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:31,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:31,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:31,613 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:31,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:31,613 INFO L85 PathProgramCache]: Analyzing trace with hash -344619170, now seen corresponding path program 1 times [2022-11-02 20:49:31,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:31,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092766808] [2022-11-02 20:49:31,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:31,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:31,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:31,616 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:31,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-02 20:49:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:31,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:49:31,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:31,840 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-02 20:49:31,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:31,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:31,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092766808] [2022-11-02 20:49:31,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092766808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:31,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:31,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:31,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291736741] [2022-11-02 20:49:31,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:31,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:31,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:31,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:31,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:31,844 INFO L87 Difference]: Start difference. First operand 3132 states and 5319 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02 20:49:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:31,893 INFO L93 Difference]: Finished difference Result 3072 states and 5233 transitions. [2022-11-02 20:49:31,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:31,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-11-02 20:49:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:31,920 INFO L225 Difference]: With dead ends: 3072 [2022-11-02 20:49:31,920 INFO L226 Difference]: Without dead ends: 3072 [2022-11-02 20:49:31,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-02 20:49:31,923 INFO L413 NwaCegarLoop]: 2954 mSDtfsCounter, 1933 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2436 SdHoareTripleChecker+Valid, 3481 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-02 20:49:31,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2436 Valid, 3481 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:49:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2022-11-02 20:49:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2022-11-02 20:49:32,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 1665 states have (on average 1.9381381381381382) internal successors, (3227), 3066 states have internal predecessors, (3227), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-11-02 20:49:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 5233 transitions. [2022-11-02 20:49:32,198 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 5233 transitions. Word has length 18 [2022-11-02 20:49:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:32,199 INFO L495 AbstractCegarLoop]: Abstraction has 3072 states and 5233 transitions. [2022-11-02 20:49:32,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02 20:49:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 5233 transitions. [2022-11-02 20:49:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:49:32,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:32,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:32,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:32,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:32,413 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:32,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:32,413 INFO L85 PathProgramCache]: Analyzing trace with hash -466544200, now seen corresponding path program 1 times [2022-11-02 20:49:32,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:32,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058736867] [2022-11-02 20:49:32,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:32,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:32,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:32,418 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:32,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-02 20:49:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:32,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:49:32,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:32,636 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-02 20:49:32,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:32,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:32,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058736867] [2022-11-02 20:49:32,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058736867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:32,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:32,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:49:32,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495928377] [2022-11-02 20:49:32,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:32,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:49:32,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:32,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:49:32,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:49:32,639 INFO L87 Difference]: Start difference. First operand 3072 states and 5233 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:32,753 INFO L93 Difference]: Finished difference Result 3044 states and 5177 transitions. [2022-11-02 20:49:32,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:49:32,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:49:32,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:32,763 INFO L225 Difference]: With dead ends: 3044 [2022-11-02 20:49:32,763 INFO L226 Difference]: Without dead ends: 3044 [2022-11-02 20:49:32,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-02 20:49:32,764 INFO L413 NwaCegarLoop]: 2909 mSDtfsCounter, 1904 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2407 SdHoareTripleChecker+Valid, 6338 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:32,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2407 Valid, 6338 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:32,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2022-11-02 20:49:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3042. [2022-11-02 20:49:33,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3042 states, 1649 states have (on average 1.9217707701637357) internal successors, (3169), 3036 states have internal predecessors, (3169), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-11-02 20:49:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 5175 transitions. [2022-11-02 20:49:33,095 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 5175 transitions. Word has length 20 [2022-11-02 20:49:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:33,095 INFO L495 AbstractCegarLoop]: Abstraction has 3042 states and 5175 transitions. [2022-11-02 20:49:33,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 5175 transitions. [2022-11-02 20:49:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:49:33,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:33,098 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] [2022-11-02 20:49:33,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:33,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:33,310 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:33,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:33,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531686, now seen corresponding path program 1 times [2022-11-02 20:49:33,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:33,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76516330] [2022-11-02 20:49:33,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:33,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:33,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:33,313 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:33,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-02 20:49:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:33,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:49:33,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:33,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:49:33,602 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-02 20:49:33,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:33,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:33,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76516330] [2022-11-02 20:49:33,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76516330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:33,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:33,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:33,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011986757] [2022-11-02 20:49:33,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:33,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:49:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:33,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:49:33,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:49:33,605 INFO L87 Difference]: Start difference. First operand 3042 states and 5175 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-02 20:49:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:38,861 INFO L93 Difference]: Finished difference Result 5473 states and 9671 transitions. [2022-11-02 20:49:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:49:38,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2022-11-02 20:49:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:38,881 INFO L225 Difference]: With dead ends: 5473 [2022-11-02 20:49:38,882 INFO L226 Difference]: Without dead ends: 5473 [2022-11-02 20:49:38,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-02 20:49:38,883 INFO L413 NwaCegarLoop]: 2988 mSDtfsCounter, 3442 mSDsluCounter, 3514 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 1019 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3442 SdHoareTripleChecker+Valid, 6502 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1019 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:38,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3442 Valid, 6502 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1019 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-02 20:49:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2022-11-02 20:49:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 3038. [2022-11-02 20:49:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3038 states, 1649 states have (on average 1.9169193450576107) internal successors, (3161), 3032 states have internal predecessors, (3161), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-11-02 20:49:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 3038 states and 5167 transitions. [2022-11-02 20:49:39,480 INFO L78 Accepts]: Start accepts. Automaton has 3038 states and 5167 transitions. Word has length 34 [2022-11-02 20:49:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:39,480 INFO L495 AbstractCegarLoop]: Abstraction has 3038 states and 5167 transitions. [2022-11-02 20:49:39,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-02 20:49:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3038 states and 5167 transitions. [2022-11-02 20:49:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:49:39,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:39,482 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] [2022-11-02 20:49:39,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:39,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:39,695 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:39,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531687, now seen corresponding path program 1 times [2022-11-02 20:49:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:39,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203243547] [2022-11-02 20:49:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:39,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:39,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:39,698 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:39,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-02 20:49:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:39,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:49:39,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:39,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:49:40,112 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-02 20:49:40,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:40,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:40,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203243547] [2022-11-02 20:49:40,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203243547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:40,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:40,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:40,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409875889] [2022-11-02 20:49:40,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:40,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:49:40,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:40,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:49:40,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:49:40,114 INFO L87 Difference]: Start difference. First operand 3038 states and 5167 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-02 20:49:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:47,583 INFO L93 Difference]: Finished difference Result 5530 states and 9693 transitions. [2022-11-02 20:49:47,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:49:47,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2022-11-02 20:49:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:47,606 INFO L225 Difference]: With dead ends: 5530 [2022-11-02 20:49:47,606 INFO L226 Difference]: Without dead ends: 5530 [2022-11-02 20:49:47,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-02 20:49:47,607 INFO L413 NwaCegarLoop]: 5152 mSDtfsCounter, 2908 mSDsluCounter, 4930 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 1004 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2908 SdHoareTripleChecker+Valid, 10082 SdHoareTripleChecker+Invalid, 3174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1004 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:47,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2908 Valid, 10082 Invalid, 3174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1004 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-11-02 20:49:47,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5530 states. [2022-11-02 20:49:48,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5530 to 3034. [2022-11-02 20:49:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 1649 states have (on average 1.9120679199514858) internal successors, (3153), 3028 states have internal predecessors, (3153), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-11-02 20:49:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 5159 transitions. [2022-11-02 20:49:48,331 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 5159 transitions. Word has length 34 [2022-11-02 20:49:48,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:48,332 INFO L495 AbstractCegarLoop]: Abstraction has 3034 states and 5159 transitions. [2022-11-02 20:49:48,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-02 20:49:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 5159 transitions. [2022-11-02 20:49:48,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:49:48,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:48,340 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] [2022-11-02 20:49:48,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:48,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:48,553 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:48,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:48,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1509555205, now seen corresponding path program 1 times [2022-11-02 20:49:48,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:48,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623126673] [2022-11-02 20:49:48,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:48,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:48,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:48,558 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:48,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-02 20:49:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:48,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:49:48,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:48,909 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-02 20:49:48,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:48,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:48,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623126673] [2022-11-02 20:49:48,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623126673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:48,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:48,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:49:48,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698132921] [2022-11-02 20:49:48,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:48,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:49:48,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:48,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:49:48,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:49:48,913 INFO L87 Difference]: Start difference. First operand 3034 states and 5159 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02 20:49:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:49,006 INFO L93 Difference]: Finished difference Result 3022 states and 5139 transitions. [2022-11-02 20:49:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:49:49,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2022-11-02 20:49:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:49,028 INFO L225 Difference]: With dead ends: 3022 [2022-11-02 20:49:49,028 INFO L226 Difference]: Without dead ends: 3022 [2022-11-02 20:49:49,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-02 20:49:49,030 INFO L413 NwaCegarLoop]: 2903 mSDtfsCounter, 1880 mSDsluCounter, 3413 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2383 SdHoareTripleChecker+Valid, 6316 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:49,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2383 Valid, 6316 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:49:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2022-11-02 20:49:49,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2022-11-02 20:49:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 1637 states have (on average 1.9138668295662797) internal successors, (3133), 3016 states have internal predecessors, (3133), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-11-02 20:49:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 5139 transitions. [2022-11-02 20:49:49,365 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 5139 transitions. Word has length 52 [2022-11-02 20:49:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:49,367 INFO L495 AbstractCegarLoop]: Abstraction has 3022 states and 5139 transitions. [2022-11-02 20:49:49,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02 20:49:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 5139 transitions. [2022-11-02 20:49:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:49:49,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:49,371 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] [2022-11-02 20:49:49,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:49,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:49,588 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:49,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:49,589 INFO L85 PathProgramCache]: Analyzing trace with hash -881686959, now seen corresponding path program 1 times [2022-11-02 20:49:49,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:49,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415800951] [2022-11-02 20:49:49,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:49,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:49,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:49,590 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:49,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-02 20:49:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:49,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:49:49,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:49,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:49:49,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:49:50,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:50,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:49:50,579 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:49:50,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-02 20:49:50,599 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-02 20:49:50,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:50,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:50,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415800951] [2022-11-02 20:49:50,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415800951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:50,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:50,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:50,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210099579] [2022-11-02 20:49:50,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:50,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:49:50,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:50,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:49:50,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:49:50,601 INFO L87 Difference]: Start difference. First operand 3022 states and 5139 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02 20:49:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:56,907 INFO L93 Difference]: Finished difference Result 5224 states and 9400 transitions. [2022-11-02 20:49:56,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:49:56,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-11-02 20:49:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:56,921 INFO L225 Difference]: With dead ends: 5224 [2022-11-02 20:49:56,921 INFO L226 Difference]: Without dead ends: 5224 [2022-11-02 20:49:56,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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-02 20:49:56,922 INFO L413 NwaCegarLoop]: 2951 mSDtfsCounter, 4397 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5400 SdHoareTripleChecker+Valid, 4163 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:56,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5400 Valid, 4163 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-02 20:49:56,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2022-11-02 20:49:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 2952. [2022-11-02 20:49:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2952 states, 1605 states have (on average 1.8872274143302181) internal successors, (3029), 2946 states have internal predecessors, (3029), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-11-02 20:49:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 5035 transitions. [2022-11-02 20:49:57,514 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 5035 transitions. Word has length 60 [2022-11-02 20:49:57,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:57,515 INFO L495 AbstractCegarLoop]: Abstraction has 2952 states and 5035 transitions. [2022-11-02 20:49:57,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02 20:49:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 5035 transitions. [2022-11-02 20:49:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:49:57,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:57,516 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] [2022-11-02 20:49:57,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:57,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:57,739 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:49:57,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:57,740 INFO L85 PathProgramCache]: Analyzing trace with hash -855470841, now seen corresponding path program 1 times [2022-11-02 20:49:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:57,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460291375] [2022-11-02 20:49:57,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:57,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:57,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:57,742 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:57,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-02 20:49:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:58,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:49:58,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:58,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:49:58,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:49:58,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-02 20:49:58,148 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-02 20:49:58,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:58,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:58,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460291375] [2022-11-02 20:49:58,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460291375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:58,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:58,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:49:58,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628146832] [2022-11-02 20:49:58,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:58,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:49:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:49:58,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:49:58,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:49:58,151 INFO L87 Difference]: Start difference. First operand 2952 states and 5035 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-02 20:50:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:00,847 INFO L93 Difference]: Finished difference Result 2951 states and 5034 transitions. [2022-11-02 20:50:00,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:50:00,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2022-11-02 20:50:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:00,851 INFO L225 Difference]: With dead ends: 2951 [2022-11-02 20:50:00,852 INFO L226 Difference]: Without dead ends: 2951 [2022-11-02 20:50:00,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:00,852 INFO L413 NwaCegarLoop]: 2863 mSDtfsCounter, 4 mSDsluCounter, 7351 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10214 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:00,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10214 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 20:50:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-11-02 20:50:01,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2951. [2022-11-02 20:50:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 1605 states have (on average 1.8866043613707164) internal successors, (3028), 2945 states have internal predecessors, (3028), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-11-02 20:50:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 5034 transitions. [2022-11-02 20:50:01,052 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 5034 transitions. Word has length 65 [2022-11-02 20:50:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:01,053 INFO L495 AbstractCegarLoop]: Abstraction has 2951 states and 5034 transitions. [2022-11-02 20:50:01,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-02 20:50:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 5034 transitions. [2022-11-02 20:50:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:50:01,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:01,054 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] [2022-11-02 20:50:01,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:01,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:50:01,269 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:50:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash -855470840, now seen corresponding path program 1 times [2022-11-02 20:50:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:50:01,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398675883] [2022-11-02 20:50:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:01,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:50:01,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:50:01,272 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:50:01,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-02 20:50:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:01,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:50:01,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:01,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:50:01,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:50:01,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:50:01,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 20:50:01,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:50:01,777 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-02 20:50:01,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:50:01,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:50:01,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398675883] [2022-11-02 20:50:01,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398675883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:01,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:01,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:50:01,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864714809] [2022-11-02 20:50:01,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:01,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:01,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:50:01,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:01,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:01,779 INFO L87 Difference]: Start difference. First operand 2951 states and 5034 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-02 20:50:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:05,396 INFO L93 Difference]: Finished difference Result 2950 states and 5033 transitions. [2022-11-02 20:50:05,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:50:05,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2022-11-02 20:50:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:05,402 INFO L225 Difference]: With dead ends: 2950 [2022-11-02 20:50:05,403 INFO L226 Difference]: Without dead ends: 2950 [2022-11-02 20:50:05,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 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-02 20:50:05,404 INFO L413 NwaCegarLoop]: 2863 mSDtfsCounter, 2 mSDsluCounter, 7387 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10250 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:05,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10250 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-02 20:50:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2022-11-02 20:50:05,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2950. [2022-11-02 20:50:05,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 1604 states have (on average 1.8871571072319202) internal successors, (3027), 2944 states have internal predecessors, (3027), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-11-02 20:50:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 5033 transitions. [2022-11-02 20:50:05,693 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 5033 transitions. Word has length 65 [2022-11-02 20:50:05,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:05,694 INFO L495 AbstractCegarLoop]: Abstraction has 2950 states and 5033 transitions. [2022-11-02 20:50:05,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-02 20:50:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 5033 transitions. [2022-11-02 20:50:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-02 20:50:05,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:05,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:05,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:05,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:50:05,911 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:50:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:05,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1522422575, now seen corresponding path program 1 times [2022-11-02 20:50:05,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:50:05,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398690252] [2022-11-02 20:50:05,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:05,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:50:05,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:50:05,914 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:50:05,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-02 20:50:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:06,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:50:06,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:06,331 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-02 20:50:06,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:50:06,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:50:06,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398690252] [2022-11-02 20:50:06,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398690252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:06,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:06,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:50:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265118258] [2022-11-02 20:50:06,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:06,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:50:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:50:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:50:06,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:50:06,335 INFO L87 Difference]: Start difference. First operand 2950 states and 5033 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-02 20:50:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:06,412 INFO L93 Difference]: Finished difference Result 2953 states and 5037 transitions. [2022-11-02 20:50:06,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:50:06,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 73 [2022-11-02 20:50:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:06,440 INFO L225 Difference]: With dead ends: 2953 [2022-11-02 20:50:06,440 INFO L226 Difference]: Without dead ends: 2953 [2022-11-02 20:50:06,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 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-02 20:50:06,442 INFO L413 NwaCegarLoop]: 2863 mSDtfsCounter, 2 mSDsluCounter, 5721 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8584 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-02 20:50:06,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8584 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:50:06,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2022-11-02 20:50:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2953. [2022-11-02 20:50:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 1606 states have (on average 1.8866749688667497) internal successors, (3030), 2947 states have internal predecessors, (3030), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-11-02 20:50:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 5037 transitions. [2022-11-02 20:50:06,790 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 5037 transitions. Word has length 73 [2022-11-02 20:50:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:06,790 INFO L495 AbstractCegarLoop]: Abstraction has 2953 states and 5037 transitions. [2022-11-02 20:50:06,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-02 20:50:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 5037 transitions. [2022-11-02 20:50:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 20:50:06,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:06,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:06,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:07,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:50:07,008 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:50:07,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1741939320, now seen corresponding path program 1 times [2022-11-02 20:50:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:50:07,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623468795] [2022-11-02 20:50:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:07,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:50:07,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:50:07,010 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:50:07,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-02 20:50:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:07,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:50:07,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:07,394 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-02 20:50:07,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:07,488 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-02 20:50:07,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:50:07,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623468795] [2022-11-02 20:50:07,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623468795] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:50:07,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:50:07,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-02 20:50:07,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924788647] [2022-11-02 20:50:07,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:07,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:50:07,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:50:07,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:50:07,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:50:07,490 INFO L87 Difference]: Start difference. First operand 2953 states and 5037 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-02 20:50:07,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:07,751 INFO L93 Difference]: Finished difference Result 2965 states and 5054 transitions. [2022-11-02 20:50:07,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:50:07,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 74 [2022-11-02 20:50:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:07,764 INFO L225 Difference]: With dead ends: 2965 [2022-11-02 20:50:07,764 INFO L226 Difference]: Without dead ends: 2965 [2022-11-02 20:50:07,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 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-02 20:50:07,765 INFO L413 NwaCegarLoop]: 2864 mSDtfsCounter, 22 mSDsluCounter, 5724 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 8588 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:07,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 8588 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:50:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2022-11-02 20:50:08,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2963. [2022-11-02 20:50:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2963 states, 1615 states have (on average 1.8854489164086687) internal successors, (3045), 2956 states have internal predecessors, (3045), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-11-02 20:50:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 5052 transitions. [2022-11-02 20:50:08,140 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 5052 transitions. Word has length 74 [2022-11-02 20:50:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:08,140 INFO L495 AbstractCegarLoop]: Abstraction has 2963 states and 5052 transitions. [2022-11-02 20:50:08,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-02 20:50:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 5052 transitions. [2022-11-02 20:50:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:50:08,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:08,142 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:08,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:08,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:50:08,363 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:50:08,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:08,363 INFO L85 PathProgramCache]: Analyzing trace with hash 755671407, now seen corresponding path program 2 times [2022-11-02 20:50:08,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:50:08,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338782197] [2022-11-02 20:50:08,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:50:08,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:50:08,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:50:08,366 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:50:08,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-02 20:50:08,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:50:08,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:50:09,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:50:09,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:09,074 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-02 20:50:09,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:09,313 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-02 20:50:09,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:50:09,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338782197] [2022-11-02 20:50:09,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338782197] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:50:09,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:50:09,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-02 20:50:09,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527615699] [2022-11-02 20:50:09,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:09,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:50:09,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:50:09,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:50:09,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:50:09,316 INFO L87 Difference]: Start difference. First operand 2963 states and 5052 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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-02 20:50:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:10,153 INFO L93 Difference]: Finished difference Result 2984 states and 5080 transitions. [2022-11-02 20:50:10,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:50:10,154 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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 77 [2022-11-02 20:50:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:10,164 INFO L225 Difference]: With dead ends: 2984 [2022-11-02 20:50:10,164 INFO L226 Difference]: Without dead ends: 2980 [2022-11-02 20:50:10,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:50:10,165 INFO L413 NwaCegarLoop]: 2867 mSDtfsCounter, 67 mSDsluCounter, 14318 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 17185 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:10,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 17185 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:50:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2022-11-02 20:50:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2972. [2022-11-02 20:50:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 1624 states have (on average 1.8823891625615763) internal successors, (3057), 2965 states have internal predecessors, (3057), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-11-02 20:50:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 5064 transitions. [2022-11-02 20:50:10,524 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 5064 transitions. Word has length 77 [2022-11-02 20:50:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:10,524 INFO L495 AbstractCegarLoop]: Abstraction has 2972 states and 5064 transitions. [2022-11-02 20:50:10,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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-02 20:50:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 5064 transitions. [2022-11-02 20:50:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:50:10,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:10,526 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:10,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:10,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:50:10,743 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:50:10,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:10,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1043203377, now seen corresponding path program 3 times [2022-11-02 20:50:10,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:50:10,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696163319] [2022-11-02 20:50:10,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:50:10,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:50:10,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:50:10,745 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:50:10,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-02 20:50:11,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-02 20:50:11,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:50:11,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:50:11,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:11,761 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-02 20:50:11,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:12,719 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-02 20:50:12,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:50:12,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696163319] [2022-11-02 20:50:12,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696163319] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:50:12,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:50:12,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-02 20:50:12,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260332209] [2022-11-02 20:50:12,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:12,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 20:50:12,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:50:12,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 20:50:12,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:50:12,722 INFO L87 Difference]: Start difference. First operand 2972 states and 5064 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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-02 20:50:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:17,271 INFO L93 Difference]: Finished difference Result 3014 states and 5126 transitions. [2022-11-02 20:50:17,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-02 20:50:17,272 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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 83 [2022-11-02 20:50:17,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:17,283 INFO L225 Difference]: With dead ends: 3014 [2022-11-02 20:50:17,284 INFO L226 Difference]: Without dead ends: 3008 [2022-11-02 20:50:17,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-11-02 20:50:17,285 INFO L413 NwaCegarLoop]: 2872 mSDtfsCounter, 162 mSDsluCounter, 40120 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 42992 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:17,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 42992 Invalid, 877 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [109 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:50:17,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2022-11-02 20:50:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2990. [2022-11-02 20:50:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 1642 states have (on average 1.8757612667478685) internal successors, (3080), 2983 states have internal predecessors, (3080), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-11-02 20:50:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 5087 transitions. [2022-11-02 20:50:17,556 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 5087 transitions. Word has length 83 [2022-11-02 20:50:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:17,557 INFO L495 AbstractCegarLoop]: Abstraction has 2990 states and 5087 transitions. [2022-11-02 20:50:17,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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-02 20:50:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 5087 transitions. [2022-11-02 20:50:17,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 20:50:17,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:17,558 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:17,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:17,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:50:17,775 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:50:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash -420145777, now seen corresponding path program 4 times [2022-11-02 20:50:17,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:50:17,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939057175] [2022-11-02 20:50:17,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:50:17,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:50:17,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:50:17,779 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:50:17,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-02 20:50:18,255 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:50:18,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:50:18,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-02 20:50:18,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:18,739 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-02 20:50:18,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:21,102 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-02 20:50:21,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:50:21,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939057175] [2022-11-02 20:50:21,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939057175] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:50:21,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:50:21,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-11-02 20:50:21,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260254483] [2022-11-02 20:50:21,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:21,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-02 20:50:21,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:50:21,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-02 20:50:21,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-11-02 20:50:21,107 INFO L87 Difference]: Start difference. First operand 2990 states and 5087 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 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-02 20:50:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:38,225 INFO L93 Difference]: Finished difference Result 3070 states and 5199 transitions. [2022-11-02 20:50:38,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-02 20:50:38,226 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 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 95 [2022-11-02 20:50:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:38,235 INFO L225 Difference]: With dead ends: 3070 [2022-11-02 20:50:38,235 INFO L226 Difference]: Without dead ends: 3066 [2022-11-02 20:50:38,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-11-02 20:50:38,239 INFO L413 NwaCegarLoop]: 2884 mSDtfsCounter, 428 mSDsluCounter, 66245 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 69129 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:38,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 69129 Invalid, 2843 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [399 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-02 20:50:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2022-11-02 20:50:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 3024. [2022-11-02 20:50:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3024 states, 1676 states have (on average 1.8651551312649164) internal successors, (3126), 3017 states have internal predecessors, (3126), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-11-02 20:50:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 5133 transitions. [2022-11-02 20:50:38,482 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 5133 transitions. Word has length 95 [2022-11-02 20:50:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:38,483 INFO L495 AbstractCegarLoop]: Abstraction has 3024 states and 5133 transitions. [2022-11-02 20:50:38,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 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-02 20:50:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 5133 transitions. [2022-11-02 20:50:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 20:50:38,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:38,485 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:38,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:38,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:50:38,703 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:50:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:38,704 INFO L85 PathProgramCache]: Analyzing trace with hash 795332591, now seen corresponding path program 5 times [2022-11-02 20:50:38,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:50:38,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243579803] [2022-11-02 20:50:38,704 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:50:38,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:50:38,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:50:38,705 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:50:38,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-02 20:50:40,264 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-02 20:50:40,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:50:40,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-02 20:50:40,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:40,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:50:40,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:50:40,453 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:50:40,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-02 20:50:40,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:50:40,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:50:40,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-02 20:50:40,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-02 20:50:40,717 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1910) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1911))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:40,730 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:40,839 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:40,855 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1920 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1920) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1921) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-02 20:50:40,870 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:40,885 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1925))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1924)))) is different from true [2022-11-02 20:50:40,900 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1926))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927)))) is different from true [2022-11-02 20:50:40,952 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:41,003 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1935))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:41,098 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:41,263 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:41,311 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:41,326 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1956))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:41,340 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:41,353 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960)))) is different from true [2022-11-02 20:50:41,441 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966)))) is different from true [2022-11-02 20:50:41,453 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:41,503 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-02 20:50:41,521 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:41,536 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977)))) is different from true [2022-11-02 20:50:41,588 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:41,680 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986)))) is different from true [2022-11-02 20:50:41,695 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:41,788 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:41,803 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:41,854 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:50:41,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-02 20:50:41,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:50:41,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-02 20:50:41,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:50:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 800 not checked. [2022-11-02 20:50:41,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:42,971 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2088 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2088) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2088 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2089 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2088) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-02 20:50:42,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:50:42,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243579803] [2022-11-02 20:50:42,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243579803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:42,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [63496579] [2022-11-02 20:50:42,980 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:50:42,980 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 20:50:42,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 20:50:42,981 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 20:50:42,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-02 20:51:54,849 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-02 20:51:54,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:51:55,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-02 20:51:55,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:55,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:51:55,224 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:51:55,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-02 20:51:55,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:51:55,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:51:55,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:51:55,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-02 20:51:55,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-02 20:51:55,471 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:55,559 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:55,619 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-02 20:51:55,634 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481))) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:55,650 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:55,697 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:55,719 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:55,735 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:55,750 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:55,766 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496)))) is different from true [2022-11-02 20:51:55,781 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:55,875 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:55,890 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-02 20:51:56,065 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:56,080 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:56,094 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:56,186 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:56,201 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527)))) is different from true [2022-11-02 20:51:56,216 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:56,232 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:56,247 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533)))) is different from true [2022-11-02 20:51:56,262 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-11-02 20:51:56,315 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:56,364 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-02 20:51:56,417 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:56,432 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:56,445 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:51:56,546 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:51:56,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-02 20:51:56,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:51:56,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-02 20:51:56,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:51:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 136 trivial. 837 not checked. [2022-11-02 20:51:56,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:57,561 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2644 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2643 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-02 20:51:57,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [63496579] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:57,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:51:57,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 60 [2022-11-02 20:51:57,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913888269] [2022-11-02 20:51:57,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:51:57,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-02 20:51:57,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:51:57,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-02 20:51:57,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=135, Unknown=60, NotChecked=3834, Total=4160 [2022-11-02 20:51:57,572 INFO L87 Difference]: Start difference. First operand 3024 states and 5133 transitions. Second operand has 61 states, 59 states have (on average 2.4915254237288136) internal successors, (147), 61 states have internal predecessors, (147), 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-02 20:51:58,233 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1935))) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915)))) is different from true [2022-11-02 20:51:58,249 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969))) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481))) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1956))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1920 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1920) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1935))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1921) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915)))) is different from true [2022-11-02 20:51:58,268 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969))) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481))) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1956))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1920 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1920) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1935))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1921) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915)))) is different from true [2022-11-02 20:51:58,287 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969))) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481))) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961))) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1956))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1925))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_1920 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1920) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1935))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1921) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960))) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915))) (exists ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1924)))) is different from true [2022-11-02 20:51:58,308 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969))) (exists ((v_ArrVal_1926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1926))) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481))) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961))) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1956))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1925))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_1920 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1920) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1935))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1921) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960))) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496))) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915))) (exists ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1924)))) is different from true [2022-11-02 20:51:58,328 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969))) (exists ((v_ArrVal_1926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1926))) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481))) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961))) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1956))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1925))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_1920 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1920) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1935))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1921) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960))) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496))) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915))) (exists ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1924)))) is different from true [2022-11-02 20:51:58,334 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:52:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:10,921 INFO L93 Difference]: Finished difference Result 5268 states and 9434 transitions. [2022-11-02 20:52:10,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:52:10,923 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 59 states have (on average 2.4915254237288136) internal successors, (147), 61 states have internal predecessors, (147), 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 117 [2022-11-02 20:52:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:10,939 INFO L225 Difference]: With dead ends: 5268 [2022-11-02 20:52:10,940 INFO L226 Difference]: Without dead ends: 5263 [2022-11-02 20:52:10,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 139 SyntacticMatches, 39 SemanticMatches, 76 ConstructedPredicates, 61 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=183, Invalid=260, Unknown=73, NotChecked=5490, Total=6006 [2022-11-02 20:52:10,942 INFO L413 NwaCegarLoop]: 3068 mSDtfsCounter, 1575 mSDsluCounter, 16258 mSDsCounter, 0 mSdLazyCounter, 4588 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2077 SdHoareTripleChecker+Valid, 19326 SdHoareTripleChecker+Invalid, 181819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 4588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177223 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:10,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2077 Valid, 19326 Invalid, 181819 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 4588 Invalid, 0 Unknown, 177223 Unchecked, 12.3s Time] [2022-11-02 20:52:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2022-11-02 20:52:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 3023. [2022-11-02 20:52:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3023 states, 1676 states have (on average 1.8627684964200477) internal successors, (3122), 3016 states have internal predecessors, (3122), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-11-02 20:52:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3023 states to 3023 states and 5129 transitions. [2022-11-02 20:52:11,665 INFO L78 Accepts]: Start accepts. Automaton has 3023 states and 5129 transitions. Word has length 117 [2022-11-02 20:52:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:11,666 INFO L495 AbstractCegarLoop]: Abstraction has 3023 states and 5129 transitions. [2022-11-02 20:52:11,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 59 states have (on average 2.4915254237288136) internal successors, (147), 61 states have internal predecessors, (147), 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-02 20:52:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3023 states and 5129 transitions. [2022-11-02 20:52:11,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 20:52:11,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:11,668 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:11,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:11,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:12,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt [2022-11-02 20:52:12,083 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:52:12,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:12,083 INFO L85 PathProgramCache]: Analyzing trace with hash 795332590, now seen corresponding path program 1 times [2022-11-02 20:52:12,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:52:12,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447542296] [2022-11-02 20:52:12,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:12,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:52:12,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:52:12,086 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:52:12,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-02 20:52:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:12,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-02 20:52:12,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:12,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:52:13,130 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:52:13,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 20:52:13,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:52:13,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 20:52:13,755 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3027) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:52:13,904 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3031) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:52:13,924 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3032 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3032) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:52:14,265 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3040 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3040)))) is different from true [2022-11-02 20:52:14,452 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045)))) is different from true [2022-11-02 20:52:14,769 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054)))) is different from true [2022-11-02 20:52:14,913 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3058)))) is different from true [2022-11-02 20:52:15,107 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:52:15,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-02 20:52:15,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-02 20:52:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 666 trivial. 287 not checked. [2022-11-02 20:52:15,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:15,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:52:15,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447542296] [2022-11-02 20:52:15,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447542296] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:15,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1967799853] [2022-11-02 20:52:15,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:15,558 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 20:52:15,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 20:52:15,559 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 20:52:15,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-02 20:52:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:18,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-02 20:52:18,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:18,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:52:18,465 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:52:18,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 20:52:18,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:52:18,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 20:52:18,636 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3481) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:52:18,696 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3483) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:52:18,847 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3487) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:52:19,440 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3501) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:52:19,711 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3508)))) is different from true [2022-11-02 20:52:20,114 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3518)))) is different from true [2022-11-02 20:52:20,175 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3520) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:52:20,195 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3521)))) is different from true [2022-11-02 20:52:20,389 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:52:20,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-02 20:52:20,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-02 20:52:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 324 not checked. [2022-11-02 20:52:20,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:20,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3570) |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-02 20:52:20,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1967799853] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:20,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:52:20,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 23 [2022-11-02 20:52:20,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812572652] [2022-11-02 20:52:20,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:20,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 20:52:20,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:52:20,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 20:52:20,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=109, Unknown=26, NotChecked=560, Total=756 [2022-11-02 20:52:20,728 INFO L87 Difference]: Start difference. First operand 3023 states and 5129 transitions. Second operand has 24 states, 22 states have (on average 4.590909090909091) internal successors, (101), 24 states have internal predecessors, (101), 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-02 20:52:21,115 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3018)))) is different from true [2022-11-02 20:52:21,122 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3027) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3508))) (exists ((v_ArrVal_3520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3520) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045))) (exists ((v_ArrVal_3487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3487) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3040 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3040))) (exists ((v_ArrVal_3018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3018))) (exists ((v_ArrVal_3518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3518))) (exists ((v_ArrVal_3058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3058))) (exists ((v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3031) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3501) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:52:21,128 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3027) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3508))) (exists ((v_ArrVal_3032 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3032) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3520) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045))) (exists ((v_ArrVal_3487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3487) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3040 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3040))) (exists ((v_ArrVal_3018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3018))) (exists ((v_ArrVal_3521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3521))) (exists ((v_ArrVal_3518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3518))) (exists ((v_ArrVal_3058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3058))) (exists ((v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3031) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3501) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:52:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:31,363 INFO L93 Difference]: Finished difference Result 5264 states and 9428 transitions. [2022-11-02 20:52:31,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:52:31,365 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.590909090909091) internal successors, (101), 24 states have internal predecessors, (101), 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 117 [2022-11-02 20:52:31,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:31,382 INFO L225 Difference]: With dead ends: 5264 [2022-11-02 20:52:31,383 INFO L226 Difference]: Without dead ends: 5262 [2022-11-02 20:52:31,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 139 SyntacticMatches, 75 SemanticMatches, 31 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=80, Invalid=147, Unknown=31, NotChecked=798, Total=1056 [2022-11-02 20:52:31,384 INFO L413 NwaCegarLoop]: 3064 mSDtfsCounter, 1570 mSDsluCounter, 13061 mSDsCounter, 0 mSdLazyCounter, 4631 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2072 SdHoareTripleChecker+Valid, 16125 SdHoareTripleChecker+Invalid, 87310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82673 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:31,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2072 Valid, 16125 Invalid, 87310 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 4631 Invalid, 0 Unknown, 82673 Unchecked, 10.2s Time] [2022-11-02 20:52:31,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5262 states. [2022-11-02 20:52:31,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5262 to 3022. [2022-11-02 20:52:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 1676 states have (on average 1.8615751789976134) internal successors, (3120), 3015 states have internal predecessors, (3120), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-11-02 20:52:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 5127 transitions. [2022-11-02 20:52:31,934 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 5127 transitions. Word has length 117 [2022-11-02 20:52:31,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:31,935 INFO L495 AbstractCegarLoop]: Abstraction has 3022 states and 5127 transitions. [2022-11-02 20:52:31,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.590909090909091) internal successors, (101), 24 states have internal predecessors, (101), 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-02 20:52:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 5127 transitions. [2022-11-02 20:52:31,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-02 20:52:31,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:31,936 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:31,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:32,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:32,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:52:32,351 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-02 20:52:32,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:32,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1581094344, now seen corresponding path program 1 times [2022-11-02 20:52:32,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:52:32,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664541195] [2022-11-02 20:52:32,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:32,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:52:32,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:52:32,355 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:52:32,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a519109-7325-4406-b2a4-30efde90a797/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-02 20:52:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:33,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-02 20:52:33,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:33,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:52:33,490 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:52:33,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 20:52:33,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:52:33,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 20:52:34,684 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3975) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:52:35,240 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3989) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:52:35,449 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:52:35,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-02 20:52:35,573 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:52:35,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-02 20:52:35,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-02 20:52:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-11-02 20:52:35,636 INFO L328 TraceCheckSpWp]: Computing backward predicates...