./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8 --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 b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:48:13,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:48:13,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:48:13,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:48:13,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:48:13,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:48:13,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:48:13,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:48:13,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:48:13,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:48:13,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:48:13,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:48:13,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:48:13,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:48:13,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:48:13,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:48:13,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:48:13,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:48:13,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:48:13,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:48:13,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:48:13,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:48:13,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:48:13,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:48:13,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:48:13,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:48:13,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:48:13,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:48:13,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:48:13,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:48:13,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:48:13,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:48:13,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:48:13,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:48:13,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:48:13,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:48:13,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:48:13,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:48:13,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:48:13,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:48:13,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:48:13,596 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 12:48:13,610 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:48:13,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:48:13,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:48:13,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:48:13,611 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:48:13,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:48:13,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:48:13,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:48:13,611 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:48:13,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:48:13,612 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:48:13,612 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:48:13,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:48:13,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:48:13,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:48:13,612 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 12:48:13,612 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 12:48:13,612 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 12:48:13,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:48:13,612 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 12:48:13,613 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:48:13,613 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:48:13,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:48:13,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:48:13,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:48:13,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:48:13,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:48:13,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:48:13,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:48:13,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:48:13,613 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:48:13,614 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:48:13,614 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:48:13,614 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:48:13,614 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/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_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8 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 -> b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 [2022-12-13 12:48:13,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:48:13,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:48:13,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:48:13,807 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:48:13,808 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:48:13,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2022-12-13 12:48:16,371 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:48:16,551 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:48:16,552 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2022-12-13 12:48:16,562 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/data/528cabba6/8fca0a051b124866bfae86c33acac403/FLAG332bedb3e [2022-12-13 12:48:16,576 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/data/528cabba6/8fca0a051b124866bfae86c33acac403 [2022-12-13 12:48:16,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:48:16,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:48:16,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:48:16,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:48:16,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:48:16,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:48:16" (1/1) ... [2022-12-13 12:48:16,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40cde93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:16, skipping insertion in model container [2022-12-13 12:48:16,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:48:16" (1/1) ... [2022-12-13 12:48:16,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:48:16,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:48:16,859 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i[33021,33034] [2022-12-13 12:48:16,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:48:16,945 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-12-13 12:48:16,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5495290a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:16, skipping insertion in model container [2022-12-13 12:48:16,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:48:16,946 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-13 12:48:16,947 INFO L158 Benchmark]: Toolchain (without parser) took 367.61ms. Allocated memory is still 132.1MB. Free memory was 90.7MB in the beginning and 71.0MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 12:48:16,948 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 132.1MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:48:16,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.53ms. Allocated memory is still 132.1MB. Free memory was 90.7MB in the beginning and 71.0MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 12:48:16,949 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.18ms. Allocated memory is still 132.1MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.53ms. Allocated memory is still 132.1MB. Free memory was 90.7MB in the beginning and 71.0MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8 --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 b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:48:18,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:48:18,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:48:18,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:48:18,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:48:18,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:48:18,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:48:18,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:48:18,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:48:18,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:48:18,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:48:18,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:48:18,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:48:18,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:48:18,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:48:18,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:48:18,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:48:18,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:48:18,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:48:18,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:48:18,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:48:18,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:48:18,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:48:18,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:48:18,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:48:18,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:48:18,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:48:18,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:48:18,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:48:18,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:48:18,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:48:18,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:48:18,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:48:18,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:48:18,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:48:18,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:48:18,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:48:18,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:48:18,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:48:18,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:48:18,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:48:18,421 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 12:48:18,444 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:48:18,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:48:18,445 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:48:18,445 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:48:18,446 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:48:18,446 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:48:18,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:48:18,447 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:48:18,447 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:48:18,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:48:18,447 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:48:18,447 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:48:18,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:48:18,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:48:18,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:48:18,448 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 12:48:18,448 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 12:48:18,448 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 12:48:18,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:48:18,449 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 12:48:18,449 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 12:48:18,449 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 12:48:18,449 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:48:18,449 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:48:18,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:48:18,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:48:18,450 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:48:18,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:48:18,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:48:18,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:48:18,450 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 12:48:18,451 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 12:48:18,451 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:48:18,451 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:48:18,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:48:18,451 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 12:48:18,451 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:48:18,451 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/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_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8 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 -> b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 [2022-12-13 12:48:18,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:48:18,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:48:18,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:48:18,698 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:48:18,699 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:48:18,700 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2022-12-13 12:48:21,355 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:48:21,586 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:48:21,587 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2022-12-13 12:48:21,600 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/data/a844216cd/eeda6eaf71fd4a88834f88ca0f291493/FLAG116b3a6f4 [2022-12-13 12:48:21,611 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/data/a844216cd/eeda6eaf71fd4a88834f88ca0f291493 [2022-12-13 12:48:21,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:48:21,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:48:21,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:48:21,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:48:21,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:48:21,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:48:21" (1/1) ... [2022-12-13 12:48:21,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f4919c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:21, skipping insertion in model container [2022-12-13 12:48:21,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:48:21" (1/1) ... [2022-12-13 12:48:21,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:48:21,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:48:21,952 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i[33021,33034] [2022-12-13 12:48:22,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:48:22,073 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-13 12:48:22,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:48:22,100 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i[33021,33034] [2022-12-13 12:48:22,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:48:22,154 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:48:22,172 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i[33021,33034] [2022-12-13 12:48:22,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:48:22,231 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:48:22,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:22 WrapperNode [2022-12-13 12:48:22,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:48:22,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:48:22,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:48:22,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:48:22,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:22" (1/1) ... [2022-12-13 12:48:22,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:22" (1/1) ... [2022-12-13 12:48:22,292 INFO L138 Inliner]: procedures = 180, calls = 349, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1158 [2022-12-13 12:48:22,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:48:22,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:48:22,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:48:22,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:48:22,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:22" (1/1) ... [2022-12-13 12:48:22,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:22" (1/1) ... [2022-12-13 12:48:22,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:22" (1/1) ... [2022-12-13 12:48:22,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:22" (1/1) ... [2022-12-13 12:48:22,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:22" (1/1) ... [2022-12-13 12:48:22,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:22" (1/1) ... [2022-12-13 12:48:22,349 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:22" (1/1) ... [2022-12-13 12:48:22,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:22" (1/1) ... [2022-12-13 12:48:22,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:48:22,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:48:22,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:48:22,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:48:22,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:22" (1/1) ... [2022-12-13 12:48:22,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:48:22,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:48:22,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:48:22,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:48:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-13 12:48:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 12:48:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 12:48:22,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 12:48:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-13 12:48:22,420 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-13 12:48:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 12:48:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:48:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:48:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 12:48:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 12:48:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:48:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 12:48:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 12:48:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:48:22,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:48:22,596 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:48:22,597 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:48:22,600 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 12:48:26,616 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:48:26,633 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:48:26,633 INFO L300 CfgBuilder]: Removed 60 assume(true) statements. [2022-12-13 12:48:26,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:48:26 BoogieIcfgContainer [2022-12-13 12:48:26,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:48:26,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:48:26,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:48:26,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:48:26,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:48:21" (1/3) ... [2022-12-13 12:48:26,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc706bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:48:26, skipping insertion in model container [2022-12-13 12:48:26,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:22" (2/3) ... [2022-12-13 12:48:26,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc706bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:48:26, skipping insertion in model container [2022-12-13 12:48:26,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:48:26" (3/3) ... [2022-12-13 12:48:26,645 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-1.i [2022-12-13 12:48:26,683 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:48:26,683 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 648 error locations. [2022-12-13 12:48:26,742 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:48:26,747 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=PETRI_NET, 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;@1d790f8a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:48:26,747 INFO L358 AbstractCegarLoop]: Starting to check reachability of 648 error locations. [2022-12-13 12:48:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 1272 states, 611 states have (on average 2.258592471358429) internal successors, (1380), 1263 states have internal predecessors, (1380), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 12:48:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 12:48:26,758 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:26,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:48:26,758 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:26,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:26,762 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-12-13 12:48:26,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:26,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776596946] [2022-12-13 12:48:26,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:26,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:26,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:26,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:26,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 12:48:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:26,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 12:48:26,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:26,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:48:26,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:26,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776596946] [2022-12-13 12:48:26,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776596946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:26,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:26,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:48:26,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142825075] [2022-12-13 12:48:26,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:26,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:48:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:26,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:48:26,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:48:26,978 INFO L87 Difference]: Start difference. First operand has 1272 states, 611 states have (on average 2.258592471358429) internal successors, (1380), 1263 states have internal predecessors, (1380), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:27,056 INFO L93 Difference]: Finished difference Result 1254 states and 1326 transitions. [2022-12-13 12:48:27,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:48:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-13 12:48:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:27,071 INFO L225 Difference]: With dead ends: 1254 [2022-12-13 12:48:27,071 INFO L226 Difference]: Without dead ends: 1252 [2022-12-13 12:48:27,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:48:27,075 INFO L413 NwaCegarLoop]: 1326 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:27,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:48:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-12-13 12:48:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2022-12-13 12:48:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 602 states have (on average 2.1461794019933556) internal successors, (1292), 1243 states have internal predecessors, (1292), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 12:48:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1324 transitions. [2022-12-13 12:48:27,155 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1324 transitions. Word has length 5 [2022-12-13 12:48:27,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:27,156 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 1324 transitions. [2022-12-13 12:48:27,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1324 transitions. [2022-12-13 12:48:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 12:48:27,156 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:27,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:48:27,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:48:27,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:27,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:27,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:27,361 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-12-13 12:48:27,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:27,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598179499] [2022-12-13 12:48:27,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:27,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:27,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:27,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:27,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 12:48:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:27,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:48:27,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:27,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 12:48:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:27,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:48:27,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:27,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598179499] [2022-12-13 12:48:27,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598179499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:27,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:27,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:48:27,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450203653] [2022-12-13 12:48:27,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:27,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:48:27,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:27,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:48:27,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:48:27,630 INFO L87 Difference]: Start difference. First operand 1252 states and 1324 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:29,457 INFO L93 Difference]: Finished difference Result 1289 states and 1374 transitions. [2022-12-13 12:48:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:48:29,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-13 12:48:29,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:29,463 INFO L225 Difference]: With dead ends: 1289 [2022-12-13 12:48:29,463 INFO L226 Difference]: Without dead ends: 1289 [2022-12-13 12:48:29,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:48:29,464 INFO L413 NwaCegarLoop]: 596 mSDtfsCounter, 1155 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:29,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 700 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-13 12:48:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2022-12-13 12:48:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1235. [2022-12-13 12:48:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 678 states have (on average 1.9675516224188792) internal successors, (1334), 1226 states have internal predecessors, (1334), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 12:48:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1366 transitions. [2022-12-13 12:48:29,487 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1366 transitions. Word has length 5 [2022-12-13 12:48:29,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:29,487 INFO L495 AbstractCegarLoop]: Abstraction has 1235 states and 1366 transitions. [2022-12-13 12:48:29,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1366 transitions. [2022-12-13 12:48:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 12:48:29,487 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:29,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:48:29,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 12:48:29,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:29,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:29,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:29,691 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-12-13 12:48:29,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:29,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672016523] [2022-12-13 12:48:29,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:29,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:29,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:29,696 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:29,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 12:48:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:29,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 12:48:29,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:29,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:48:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:29,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:48:29,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:29,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672016523] [2022-12-13 12:48:29,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672016523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:29,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:29,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:48:29,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206026251] [2022-12-13 12:48:29,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:29,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:48:29,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:29,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:48:29,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:48:29,833 INFO L87 Difference]: Start difference. First operand 1235 states and 1366 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:32,597 INFO L93 Difference]: Finished difference Result 1538 states and 1689 transitions. [2022-12-13 12:48:32,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:48:32,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-13 12:48:32,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:32,600 INFO L225 Difference]: With dead ends: 1538 [2022-12-13 12:48:32,600 INFO L226 Difference]: Without dead ends: 1538 [2022-12-13 12:48:32,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:48:32,601 INFO L413 NwaCegarLoop]: 992 mSDtfsCounter, 504 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:32,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1475 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-12-13 12:48:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-12-13 12:48:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1391. [2022-12-13 12:48:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 844 states have (on average 1.9431279620853081) internal successors, (1640), 1382 states have internal predecessors, (1640), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 12:48:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1672 transitions. [2022-12-13 12:48:32,618 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1672 transitions. Word has length 5 [2022-12-13 12:48:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:32,618 INFO L495 AbstractCegarLoop]: Abstraction has 1391 states and 1672 transitions. [2022-12-13 12:48:32,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1672 transitions. [2022-12-13 12:48:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 12:48:32,619 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:32,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 12:48:32,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 12:48:32,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:32,820 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:32,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1157590079, now seen corresponding path program 1 times [2022-12-13 12:48:32,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:32,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498396393] [2022-12-13 12:48:32,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:32,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:32,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:32,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:32,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 12:48:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:32,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 12:48:32,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:32,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:48:32,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:32,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498396393] [2022-12-13 12:48:32,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498396393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:32,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:32,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:48:32,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266991647] [2022-12-13 12:48:32,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:32,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:48:32,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:32,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:48:32,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:48:32,893 INFO L87 Difference]: Start difference. First operand 1391 states and 1672 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:32,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:32,983 INFO L93 Difference]: Finished difference Result 2733 states and 3275 transitions. [2022-12-13 12:48:32,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:48:32,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-13 12:48:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:32,992 INFO L225 Difference]: With dead ends: 2733 [2022-12-13 12:48:32,992 INFO L226 Difference]: Without dead ends: 2733 [2022-12-13 12:48:32,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:48:32,993 INFO L413 NwaCegarLoop]: 1498 mSDtfsCounter, 1139 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:32,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 2714 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:48:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2022-12-13 12:48:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 1392. [2022-12-13 12:48:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 845 states have (on average 1.9420118343195267) internal successors, (1641), 1383 states have internal predecessors, (1641), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 12:48:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1673 transitions. [2022-12-13 12:48:33,017 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1673 transitions. Word has length 6 [2022-12-13 12:48:33,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:33,018 INFO L495 AbstractCegarLoop]: Abstraction has 1392 states and 1673 transitions. [2022-12-13 12:48:33,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1673 transitions. [2022-12-13 12:48:33,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 12:48:33,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:33,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:33,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 12:48:33,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:33,219 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:33,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:33,220 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-12-13 12:48:33,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:33,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608332532] [2022-12-13 12:48:33,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:33,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:33,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:33,222 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:33,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 12:48:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:33,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 12:48:33,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:33,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:48:33,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:33,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608332532] [2022-12-13 12:48:33,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608332532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:33,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:33,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:48:33,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665229992] [2022-12-13 12:48:33,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:33,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:48:33,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:33,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:48:33,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:48:33,420 INFO L87 Difference]: Start difference. First operand 1392 states and 1673 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:33,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:33,448 INFO L93 Difference]: Finished difference Result 1356 states and 1636 transitions. [2022-12-13 12:48:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:48:33,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-13 12:48:33,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:33,452 INFO L225 Difference]: With dead ends: 1356 [2022-12-13 12:48:33,452 INFO L226 Difference]: Without dead ends: 1356 [2022-12-13 12:48:33,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:48:33,453 INFO L413 NwaCegarLoop]: 1173 mSDtfsCounter, 1133 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:33,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 1206 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:48:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-12-13 12:48:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1350. [2022-12-13 12:48:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 827 states have (on average 1.932285368802902) internal successors, (1598), 1341 states have internal predecessors, (1598), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 12:48:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1630 transitions. [2022-12-13 12:48:33,470 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1630 transitions. Word has length 11 [2022-12-13 12:48:33,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:33,470 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 1630 transitions. [2022-12-13 12:48:33,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1630 transitions. [2022-12-13 12:48:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 12:48:33,471 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:33,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:33,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 12:48:33,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:33,671 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:33,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:33,672 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-12-13 12:48:33,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:33,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844290564] [2022-12-13 12:48:33,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:33,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:33,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:33,674 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:33,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 12:48:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:33,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:48:33,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:33,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:48:33,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:33,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844290564] [2022-12-13 12:48:33,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844290564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:33,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:33,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:33,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169909285] [2022-12-13 12:48:33,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:33,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:33,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:33,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:33,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:33,796 INFO L87 Difference]: Start difference. First operand 1350 states and 1630 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:33,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:33,863 INFO L93 Difference]: Finished difference Result 1335 states and 1608 transitions. [2022-12-13 12:48:33,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:48:33,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 12:48:33,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:33,868 INFO L225 Difference]: With dead ends: 1335 [2022-12-13 12:48:33,868 INFO L226 Difference]: Without dead ends: 1335 [2022-12-13 12:48:33,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:48:33,869 INFO L413 NwaCegarLoop]: 1128 mSDtfsCounter, 1114 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:33,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 2282 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:48:33,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-12-13 12:48:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1328. [2022-12-13 12:48:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 819 states have (on average 1.9157509157509158) internal successors, (1569), 1319 states have internal predecessors, (1569), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 12:48:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1601 transitions. [2022-12-13 12:48:33,893 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1601 transitions. Word has length 13 [2022-12-13 12:48:33,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:33,893 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 1601 transitions. [2022-12-13 12:48:33,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1601 transitions. [2022-12-13 12:48:33,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 12:48:33,894 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:33,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:33,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 12:48:34,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:34,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:34,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:34,095 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-12-13 12:48:34,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:34,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845274325] [2022-12-13 12:48:34,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:34,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:34,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:34,097 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:34,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 12:48:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:34,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 12:48:34,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:34,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 12:48:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:34,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:48:34,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:34,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845274325] [2022-12-13 12:48:34,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845274325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:34,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:34,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:48:34,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629500712] [2022-12-13 12:48:34,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:34,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:34,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:34,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:34,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:34,272 INFO L87 Difference]: Start difference. First operand 1328 states and 1601 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:36,938 INFO L93 Difference]: Finished difference Result 1788 states and 2048 transitions. [2022-12-13 12:48:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:48:36,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 12:48:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:36,941 INFO L225 Difference]: With dead ends: 1788 [2022-12-13 12:48:36,941 INFO L226 Difference]: Without dead ends: 1788 [2022-12-13 12:48:36,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:48:36,942 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 2384 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2397 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:36,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2397 Valid, 1001 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-12-13 12:48:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2022-12-13 12:48:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1324. [2022-12-13 12:48:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 819 states have (on average 1.910866910866911) internal successors, (1565), 1315 states have internal predecessors, (1565), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 12:48:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1597 transitions. [2022-12-13 12:48:36,958 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1597 transitions. Word has length 27 [2022-12-13 12:48:36,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:36,958 INFO L495 AbstractCegarLoop]: Abstraction has 1324 states and 1597 transitions. [2022-12-13 12:48:36,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1597 transitions. [2022-12-13 12:48:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 12:48:36,959 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:36,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:36,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 12:48:37,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:37,159 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:37,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:37,160 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-12-13 12:48:37,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:37,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834850833] [2022-12-13 12:48:37,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:37,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:37,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:37,161 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:37,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 12:48:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:37,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 12:48:37,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:37,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:48:37,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-12-13 12:48:37,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:48:37,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:37,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834850833] [2022-12-13 12:48:37,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834850833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:37,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:37,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:48:37,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513253090] [2022-12-13 12:48:37,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:37,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:37,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:37,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:37,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:37,378 INFO L87 Difference]: Start difference. First operand 1324 states and 1597 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:40,513 INFO L93 Difference]: Finished difference Result 1508 states and 1671 transitions. [2022-12-13 12:48:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:48:40,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 12:48:40,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:40,519 INFO L225 Difference]: With dead ends: 1508 [2022-12-13 12:48:40,519 INFO L226 Difference]: Without dead ends: 1508 [2022-12-13 12:48:40,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:48:40,520 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 851 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:40,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1911 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-12-13 12:48:40,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-12-13 12:48:40,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1320. [2022-12-13 12:48:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 819 states have (on average 1.9059829059829059) internal successors, (1561), 1311 states have internal predecessors, (1561), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 12:48:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1593 transitions. [2022-12-13 12:48:40,533 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1593 transitions. Word has length 27 [2022-12-13 12:48:40,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:40,533 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 1593 transitions. [2022-12-13 12:48:40,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1593 transitions. [2022-12-13 12:48:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 12:48:40,534 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:40,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:40,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 12:48:40,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:40,736 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:40,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:40,737 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-12-13 12:48:40,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:40,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349147366] [2022-12-13 12:48:40,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:40,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:40,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:40,744 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:40,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 12:48:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:40,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:48:40,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:40,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:48:40,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:40,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349147366] [2022-12-13 12:48:40,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349147366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:40,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:40,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:40,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955405784] [2022-12-13 12:48:40,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:40,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:40,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:40,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:40,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:40,972 INFO L87 Difference]: Start difference. First operand 1320 states and 1593 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:41,023 INFO L93 Difference]: Finished difference Result 1320 states and 1589 transitions. [2022-12-13 12:48:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:48:41,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-12-13 12:48:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:41,026 INFO L225 Difference]: With dead ends: 1320 [2022-12-13 12:48:41,026 INFO L226 Difference]: Without dead ends: 1320 [2022-12-13 12:48:41,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:48:41,026 INFO L413 NwaCegarLoop]: 1122 mSDtfsCounter, 1083 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:41,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 2260 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:48:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2022-12-13 12:48:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1314. [2022-12-13 12:48:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 813 states have (on average 1.9077490774907748) internal successors, (1551), 1305 states have internal predecessors, (1551), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 12:48:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1583 transitions. [2022-12-13 12:48:41,039 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1583 transitions. Word has length 42 [2022-12-13 12:48:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:41,039 INFO L495 AbstractCegarLoop]: Abstraction has 1314 states and 1583 transitions. [2022-12-13 12:48:41,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1583 transitions. [2022-12-13 12:48:41,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 12:48:41,040 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:41,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:41,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-13 12:48:41,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:41,241 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:41,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:41,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-12-13 12:48:41,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:41,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988857201] [2022-12-13 12:48:41,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:41,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:41,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:41,243 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:41,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 12:48:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:41,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:48:41,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:41,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:48:41,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:41,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988857201] [2022-12-13 12:48:41,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988857201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:41,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:41,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:48:41,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710516845] [2022-12-13 12:48:41,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:41,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:48:41,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:41,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:48:41,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:48:41,582 INFO L87 Difference]: Start difference. First operand 1314 states and 1583 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:41,652 INFO L93 Difference]: Finished difference Result 1360 states and 1629 transitions. [2022-12-13 12:48:41,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:48:41,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-12-13 12:48:41,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:41,655 INFO L225 Difference]: With dead ends: 1360 [2022-12-13 12:48:41,655 INFO L226 Difference]: Without dead ends: 1360 [2022-12-13 12:48:41,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:48:41,656 INFO L413 NwaCegarLoop]: 1130 mSDtfsCounter, 67 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:41,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 2165 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:48:41,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-12-13 12:48:41,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2022-12-13 12:48:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 859 states have (on average 1.859138533178114) internal successors, (1597), 1351 states have internal predecessors, (1597), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 12:48:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1629 transitions. [2022-12-13 12:48:41,673 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1629 transitions. Word has length 50 [2022-12-13 12:48:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:41,673 INFO L495 AbstractCegarLoop]: Abstraction has 1360 states and 1629 transitions. [2022-12-13 12:48:41,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1629 transitions. [2022-12-13 12:48:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 12:48:41,674 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:41,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:41,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-13 12:48:41,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:41,875 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:41,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:41,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-12-13 12:48:41,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:41,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670051708] [2022-12-13 12:48:41,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:41,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:41,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:41,877 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:41,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-13 12:48:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:42,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 12:48:42,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:42,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:48:42,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 12:48:42,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:48:42,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 12:48:42,459 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 12:48:42,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 12:48:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:42,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:48:42,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:42,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670051708] [2022-12-13 12:48:42,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670051708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:42,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:42,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:48:42,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038316264] [2022-12-13 12:48:42,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:42,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:42,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:42,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:42,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:42,479 INFO L87 Difference]: Start difference. First operand 1360 states and 1629 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:44,934 INFO L93 Difference]: Finished difference Result 1329 states and 1552 transitions. [2022-12-13 12:48:44,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:48:44,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-12-13 12:48:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:44,939 INFO L225 Difference]: With dead ends: 1329 [2022-12-13 12:48:44,939 INFO L226 Difference]: Without dead ends: 1329 [2022-12-13 12:48:44,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:44,940 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 1047 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:44,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 526 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-12-13 12:48:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-12-13 12:48:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1110. [2022-12-13 12:48:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 693 states have (on average 1.725829725829726) internal successors, (1196), 1101 states have internal predecessors, (1196), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 12:48:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1228 transitions. [2022-12-13 12:48:44,950 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1228 transitions. Word has length 53 [2022-12-13 12:48:44,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:44,950 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1228 transitions. [2022-12-13 12:48:44,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1228 transitions. [2022-12-13 12:48:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 12:48:44,951 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:44,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:44,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-13 12:48:45,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:45,151 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:45,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:45,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-12-13 12:48:45,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:45,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676312418] [2022-12-13 12:48:45,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:45,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:45,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:45,153 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:45,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-13 12:48:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:45,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 12:48:45,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:45,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 12:48:45,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:48:45,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 12:48:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:45,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:48:45,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:45,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676312418] [2022-12-13 12:48:45,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676312418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:45,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:45,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:45,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986635301] [2022-12-13 12:48:45,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:45,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:48:45,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:45,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:48:45,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:48:45,386 INFO L87 Difference]: Start difference. First operand 1110 states and 1228 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:48,027 INFO L93 Difference]: Finished difference Result 1109 states and 1227 transitions. [2022-12-13 12:48:48,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:48:48,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-13 12:48:48,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:48,030 INFO L225 Difference]: With dead ends: 1109 [2022-12-13 12:48:48,030 INFO L226 Difference]: Without dead ends: 1109 [2022-12-13 12:48:48,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:48:48,030 INFO L413 NwaCegarLoop]: 1042 mSDtfsCounter, 4 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:48,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2633 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-12-13 12:48:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-12-13 12:48:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2022-12-13 12:48:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 693 states have (on average 1.7243867243867244) internal successors, (1195), 1100 states have internal predecessors, (1195), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 12:48:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1227 transitions. [2022-12-13 12:48:48,038 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1227 transitions. Word has length 58 [2022-12-13 12:48:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:48,039 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1227 transitions. [2022-12-13 12:48:48,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1227 transitions. [2022-12-13 12:48:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 12:48:48,039 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:48,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:48,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-13 12:48:48,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:48,240 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:48,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:48,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-12-13 12:48:48,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:48,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033513202] [2022-12-13 12:48:48,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:48,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:48,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:48,245 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:48,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-13 12:48:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:48,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 12:48:48,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:48,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:48:48,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:48:48,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:48:48,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-12-13 12:48:48,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 12:48:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:48,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:48:48,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:48,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033513202] [2022-12-13 12:48:48,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033513202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:48,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:48,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:48,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840722457] [2022-12-13 12:48:48,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:48,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:48:48,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:48,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:48:48,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:48:48,545 INFO L87 Difference]: Start difference. First operand 1109 states and 1227 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:51,787 INFO L93 Difference]: Finished difference Result 1108 states and 1226 transitions. [2022-12-13 12:48:51,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:48:51,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-13 12:48:51,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:51,789 INFO L225 Difference]: With dead ends: 1108 [2022-12-13 12:48:51,789 INFO L226 Difference]: Without dead ends: 1108 [2022-12-13 12:48:51,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:48:51,790 INFO L413 NwaCegarLoop]: 1042 mSDtfsCounter, 2 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2656 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:51,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2656 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-12-13 12:48:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2022-12-13 12:48:51,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2022-12-13 12:48:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 692 states have (on average 1.7254335260115607) internal successors, (1194), 1099 states have internal predecessors, (1194), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 12:48:51,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1226 transitions. [2022-12-13 12:48:51,801 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1226 transitions. Word has length 58 [2022-12-13 12:48:51,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:51,801 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1226 transitions. [2022-12-13 12:48:51,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:48:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1226 transitions. [2022-12-13 12:48:51,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 12:48:51,802 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:51,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:51,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-12-13 12:48:52,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:52,003 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:52,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:52,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2038939938, now seen corresponding path program 1 times [2022-12-13 12:48:52,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:52,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407321051] [2022-12-13 12:48:52,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:52,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:52,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:52,007 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:52,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-12-13 12:48:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:52,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:48:52,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:52,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:48:52,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:52,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407321051] [2022-12-13 12:48:52,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407321051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:52,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:52,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:52,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216512016] [2022-12-13 12:48:52,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:52,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:52,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:52,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:52,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:52,257 INFO L87 Difference]: Start difference. First operand 1108 states and 1226 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 12:48:52,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:52,301 INFO L93 Difference]: Finished difference Result 1111 states and 1231 transitions. [2022-12-13 12:48:52,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:48:52,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-12-13 12:48:52,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:52,304 INFO L225 Difference]: With dead ends: 1111 [2022-12-13 12:48:52,304 INFO L226 Difference]: Without dead ends: 1111 [2022-12-13 12:48:52,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:48:52,305 INFO L413 NwaCegarLoop]: 1041 mSDtfsCounter, 2 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:52,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3115 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:48:52,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-12-13 12:48:52,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2022-12-13 12:48:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 694 states have (on average 1.7247838616714697) internal successors, (1197), 1102 states have internal predecessors, (1197), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 12:48:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1231 transitions. [2022-12-13 12:48:52,317 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1231 transitions. Word has length 66 [2022-12-13 12:48:52,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:52,317 INFO L495 AbstractCegarLoop]: Abstraction has 1111 states and 1231 transitions. [2022-12-13 12:48:52,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 12:48:52,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1231 transitions. [2022-12-13 12:48:52,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 12:48:52,318 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:52,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:52,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-12-13 12:48:52,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:52,519 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:52,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:52,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2031497853, now seen corresponding path program 1 times [2022-12-13 12:48:52,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:52,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159211398] [2022-12-13 12:48:52,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:52,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:52,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:52,525 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:52,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-12-13 12:48:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:52,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 12:48:52,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:52,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:48:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:52,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:52,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159211398] [2022-12-13 12:48:52,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159211398] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:48:52,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:48:52,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-12-13 12:48:52,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758882404] [2022-12-13 12:48:52,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:48:52,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:48:52,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:52,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:48:52,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:48:52,816 INFO L87 Difference]: Start difference. First operand 1111 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:48:52,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:52,985 INFO L93 Difference]: Finished difference Result 1123 states and 1249 transitions. [2022-12-13 12:48:52,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:48:52,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-12-13 12:48:52,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:52,987 INFO L225 Difference]: With dead ends: 1123 [2022-12-13 12:48:52,987 INFO L226 Difference]: Without dead ends: 1123 [2022-12-13 12:48:52,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:48:52,988 INFO L413 NwaCegarLoop]: 1041 mSDtfsCounter, 9 mSDsluCounter, 5172 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6213 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:52,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6213 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:48:52,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-12-13 12:48:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1121. [2022-12-13 12:48:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 703 states have (on average 1.7240398293029873) internal successors, (1212), 1111 states have internal predecessors, (1212), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 12:48:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1246 transitions. [2022-12-13 12:48:52,997 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1246 transitions. Word has length 67 [2022-12-13 12:48:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:52,997 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 1246 transitions. [2022-12-13 12:48:52,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:48:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1246 transitions. [2022-12-13 12:48:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 12:48:52,998 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:52,998 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:53,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-12-13 12:48:53,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:53,199 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:53,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:53,200 INFO L85 PathProgramCache]: Analyzing trace with hash 942124702, now seen corresponding path program 2 times [2022-12-13 12:48:53,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:53,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550845407] [2022-12-13 12:48:53,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:48:53,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:53,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:53,202 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:53,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-12-13 12:48:53,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:48:53,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:48:53,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 12:48:53,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:53,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:48:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:53,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:53,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550845407] [2022-12-13 12:48:53,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550845407] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:48:53,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:48:53,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-12-13 12:48:53,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018705142] [2022-12-13 12:48:53,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:48:53,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 12:48:53,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:53,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 12:48:53,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-12-13 12:48:53,847 INFO L87 Difference]: Start difference. First operand 1121 states and 1246 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:48:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:54,442 INFO L93 Difference]: Finished difference Result 1142 states and 1278 transitions. [2022-12-13 12:48:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 12:48:54,443 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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 70 [2022-12-13 12:48:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:54,445 INFO L225 Difference]: With dead ends: 1142 [2022-12-13 12:48:54,445 INFO L226 Difference]: Without dead ends: 1138 [2022-12-13 12:48:54,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-12-13 12:48:54,445 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 23 mSDsluCounter, 6232 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7276 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:54,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 7276 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 12:48:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-12-13 12:48:54,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1130. [2022-12-13 12:48:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 712 states have (on average 1.7191011235955056) internal successors, (1224), 1120 states have internal predecessors, (1224), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 12:48:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1258 transitions. [2022-12-13 12:48:54,455 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1258 transitions. Word has length 70 [2022-12-13 12:48:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:54,455 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 1258 transitions. [2022-12-13 12:48:54,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:48:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1258 transitions. [2022-12-13 12:48:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-13 12:48:54,455 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:54,455 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:54,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-12-13 12:48:54,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:54,657 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:54,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:54,658 INFO L85 PathProgramCache]: Analyzing trace with hash -795487682, now seen corresponding path program 3 times [2022-12-13 12:48:54,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:54,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350587280] [2022-12-13 12:48:54,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 12:48:54,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:54,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:54,663 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:54,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-12-13 12:48:55,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-13 12:48:55,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:48:55,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 12:48:55,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:55,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:48:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:55,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:48:55,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350587280] [2022-12-13 12:48:55,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350587280] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:48:55,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:48:55,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-12-13 12:48:55,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236494656] [2022-12-13 12:48:55,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:48:55,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 12:48:55,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:48:55,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 12:48:55,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-12-13 12:48:55,864 INFO L87 Difference]: Start difference. First operand 1130 states and 1258 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:48:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:48:58,721 INFO L93 Difference]: Finished difference Result 1172 states and 1334 transitions. [2022-12-13 12:48:58,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 12:48:58,722 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 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 76 [2022-12-13 12:48:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:48:58,725 INFO L225 Difference]: With dead ends: 1172 [2022-12-13 12:48:58,725 INFO L226 Difference]: Without dead ends: 1166 [2022-12-13 12:48:58,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-12-13 12:48:58,726 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 49 mSDsluCounter, 12504 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 13552 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:48:58,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 13552 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 12:48:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2022-12-13 12:48:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1148. [2022-12-13 12:48:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 730 states have (on average 1.7082191780821918) internal successors, (1247), 1138 states have internal predecessors, (1247), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 12:48:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1281 transitions. [2022-12-13 12:48:58,742 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1281 transitions. Word has length 76 [2022-12-13 12:48:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:48:58,742 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 1281 transitions. [2022-12-13 12:48:58,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:48:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1281 transitions. [2022-12-13 12:48:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-13 12:48:58,743 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:48:58,743 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:58,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-12-13 12:48:58,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:58,944 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:48:58,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash -944213634, now seen corresponding path program 4 times [2022-12-13 12:48:58,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:48:58,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768952788] [2022-12-13 12:48:58,945 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 12:48:58,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:48:58,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:48:58,946 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:48:58,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-12-13 12:48:59,219 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 12:48:59,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:48:59,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 12:48:59,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:48:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:59,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:49:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:49:01,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:49:01,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768952788] [2022-12-13 12:49:01,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768952788] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:49:01,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:49:01,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-12-13 12:49:01,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379821989] [2022-12-13 12:49:01,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:49:01,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-13 12:49:01,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:49:01,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-13 12:49:01,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-12-13 12:49:01,347 INFO L87 Difference]: Start difference. First operand 1148 states and 1281 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:49:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:10,597 INFO L93 Difference]: Finished difference Result 1228 states and 1414 transitions. [2022-12-13 12:49:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-12-13 12:49:10,597 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 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 88 [2022-12-13 12:49:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:10,600 INFO L225 Difference]: With dead ends: 1228 [2022-12-13 12:49:10,600 INFO L226 Difference]: Without dead ends: 1224 [2022-12-13 12:49:10,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-12-13 12:49:10,603 INFO L413 NwaCegarLoop]: 1061 mSDtfsCounter, 78 mSDsluCounter, 24293 mSDsCounter, 0 mSdLazyCounter, 3024 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 25354 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 3024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:10,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 25354 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 3024 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-13 12:49:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2022-12-13 12:49:10,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1182. [2022-12-13 12:49:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 764 states have (on average 1.692408376963351) internal successors, (1293), 1172 states have internal predecessors, (1293), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 12:49:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1327 transitions. [2022-12-13 12:49:10,624 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1327 transitions. Word has length 88 [2022-12-13 12:49:10,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:10,625 INFO L495 AbstractCegarLoop]: Abstraction has 1182 states and 1327 transitions. [2022-12-13 12:49:10,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:49:10,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1327 transitions. [2022-12-13 12:49:10,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-13 12:49:10,626 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:10,626 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] [2022-12-13 12:49:10,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-12-13 12:49:10,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:49:10,827 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:49:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1478038498, now seen corresponding path program 5 times [2022-12-13 12:49:10,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:49:10,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612408625] [2022-12-13 12:49:10,828 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 12:49:10,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:49:10,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:49:10,829 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:49:10,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-12-13 12:49:12,214 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-12-13 12:49:12,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:49:12,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 12:49:12,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:49:12,269 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-13 12:49:12,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2022-12-13 12:49:12,578 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-12-13 12:49:12,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-12-13 12:49:12,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:49:12,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2022-12-13 12:49:12,989 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_11))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1564)))) is different from true [2022-12-13 12:49:13,555 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_11))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1581)))) is different from true [2022-12-13 12:49:13,803 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_11))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1589 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1589)))) is different from true [2022-12-13 12:49:14,240 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_11))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1603)))) is different from true [2022-12-13 12:49:14,362 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:49:14,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-12-13 12:49:14,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2022-12-13 12:49:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-12-13 12:49:14,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:49:16,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:49:16,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612408625] [2022-12-13 12:49:16,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612408625] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:49:16,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [398859360] [2022-12-13 12:49:16,781 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 12:49:16,781 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 12:49:16,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 12:49:16,782 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 12:49:16,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-12-13 12:50:23,261 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-12-13 12:50:23,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:50:23,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-13 12:50:23,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:50:23,531 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 12:50:23,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 12:50:23,771 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-12-13 12:50:23,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-12-13 12:50:23,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:50:24,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-12-13 12:50:26,962 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:50:26,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:50:27,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-12-13 12:50:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-12-13 12:50:27,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:50:29,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [398859360] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:50:29,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:50:29,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 20 [2022-12-13 12:50:29,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103978691] [2022-12-13 12:50:29,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:50:29,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 12:50:29,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:50:29,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 12:50:29,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=336, Unknown=30, NotChecked=164, Total=600 [2022-12-13 12:50:29,363 INFO L87 Difference]: Start difference. First operand 1182 states and 1327 transitions. Second operand has 22 states, 19 states have (on average 7.368421052631579) internal successors, (140), 21 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:50:50,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:50:50,083 INFO L93 Difference]: Finished difference Result 2281 states and 2468 transitions. [2022-12-13 12:50:50,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 12:50:50,083 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.368421052631579) internal successors, (140), 21 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2022-12-13 12:50:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:50:50,089 INFO L225 Difference]: With dead ends: 2281 [2022-12-13 12:50:50,089 INFO L226 Difference]: Without dead ends: 2273 [2022-12-13 12:50:50,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 118 SyntacticMatches, 87 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=256, Invalid=1238, Unknown=82, NotChecked=316, Total=1892 [2022-12-13 12:50:50,090 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 4479 mSDsluCounter, 5051 mSDsCounter, 0 mSdLazyCounter, 6609 mSolverCounterSat, 168 mSolverCounterUnsat, 1998 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4479 SdHoareTripleChecker+Valid, 5566 SdHoareTripleChecker+Invalid, 17085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 6609 IncrementalHoareTripleChecker+Invalid, 1998 IncrementalHoareTripleChecker+Unknown, 8310 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2022-12-13 12:50:50,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4479 Valid, 5566 Invalid, 17085 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [168 Valid, 6609 Invalid, 1998 Unknown, 8310 Unchecked, 19.5s Time] [2022-12-13 12:50:50,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2022-12-13 12:50:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 1230. [2022-12-13 12:50:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 812 states have (on average 1.6514778325123152) internal successors, (1341), 1219 states have internal predecessors, (1341), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 12:50:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1375 transitions. [2022-12-13 12:50:50,108 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1375 transitions. Word has length 110 [2022-12-13 12:50:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:50:50,108 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1375 transitions. [2022-12-13 12:50:50,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.368421052631579) internal successors, (140), 21 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:50:50,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1375 transitions. [2022-12-13 12:50:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-13 12:50:50,112 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:50:50,113 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] [2022-12-13 12:50:50,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2022-12-13 12:50:50,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-12-13 12:50:50,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:50:50,514 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:50:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:50:50,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1478038497, now seen corresponding path program 1 times [2022-12-13 12:50:50,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:50:50,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531565232] [2022-12-13 12:50:50,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:50:50,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:50:50,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:50:50,519 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:50:50,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-12-13 12:50:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:51,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 110 conjunts are in the unsatisfiable core [2022-12-13 12:50:51,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:50:51,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 12:50:51,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:50:51,311 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 12:50:51,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 12:50:51,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:50:51,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:50:51,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-12-13 12:50:51,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 12:50:51,493 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456)))) is different from true [2022-12-13 12:50:51,503 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459)))) is different from true [2022-12-13 12:50:51,514 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461)))) is different from true [2022-12-13 12:50:51,525 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463)))) is different from true [2022-12-13 12:50:51,568 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467)))) is different from true [2022-12-13 12:50:51,579 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:50:51,590 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2471))) (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|))) is different from true [2022-12-13 12:50:51,600 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472)))) is different from true [2022-12-13 12:50:51,609 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2474 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2474) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:50:51,618 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476)))) is different from true [2022-12-13 12:50:51,628 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479)))) is different from true [2022-12-13 12:50:51,638 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481) |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|))) is different from true [2022-12-13 12:50:51,648 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.offset|)) (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|))) is different from true [2022-12-13 12:50:51,657 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485)))) is different from true [2022-12-13 12:50:51,668 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486)))) is different from true [2022-12-13 12:50:51,679 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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)))) is different from true [2022-12-13 12:50:51,690 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490)))) is different from true [2022-12-13 12:50:51,699 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:50:51,735 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:50:51,745 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:50:51,755 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-12-13 12:50:51,765 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-12-13 12:50:51,775 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.offset|)) (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)))) is different from true [2022-12-13 12:50:51,815 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:50:51,826 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-12-13 12:50:51,836 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513)))) is different from true [2022-12-13 12:50:51,846 WARN L859 $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_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:50:51,857 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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)))) is different from true [2022-12-13 12:50:51,867 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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)))) is different from true [2022-12-13 12:50:51,878 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |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)))) is different from true [2022-12-13 12:50:51,887 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:50:51,897 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524)))) is different from true [2022-12-13 12:50:51,907 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (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|))) is different from true [2022-12-13 12:50:51,915 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:50:51,927 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530)))) is different from true [2022-12-13 12:50:51,937 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532))) (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-12-13 12:50:51,948 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-12-13 12:50:51,957 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (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)))) is different from true [2022-12-13 12:50:51,968 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538)))) is different from true [2022-12-13 12:50:51,979 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541))) (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|))) is different from true [2022-12-13 12:50:51,988 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542)))) is different from true [2022-12-13 12:50:52,025 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:50:52,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:50:52,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 12:50:52,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:50:52,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:50:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2022-12-13 12:50:52,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:50:52,870 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 12:50:52,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:50:52,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531565232] [2022-12-13 12:50:52,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531565232] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:50:52,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1866302110] [2022-12-13 12:50:52,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:50:52,882 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 12:50:52,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 12:50:52,883 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 12:50:52,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-12-13 12:52:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:35,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 110 conjunts are in the unsatisfiable core [2022-12-13 12:52:35,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:52:35,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 12:52:35,822 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 12:52:35,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 12:52:35,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:52:35,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:52:35,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:52:36,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 12:52:36,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-13 12:52:36,066 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2995) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:52:36,075 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2997))) (exists ((v_ArrVal_2996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2996)))) is different from true [2022-12-13 12:52:36,085 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2998))) (exists ((v_ArrVal_2999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2999)))) is different from true [2022-12-13 12:52:36,097 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3001))) (exists ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3000)))) is different from true [2022-12-13 12:52:36,157 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3006) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3007)))) is different from true [2022-12-13 12:52:36,168 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3009))) (exists ((v_ArrVal_3008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3008)))) is different from true [2022-12-13 12:52:36,179 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3011))) (exists ((v_ArrVal_3010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3010)))) is different from true [2022-12-13 12:52:36,217 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3015))) (exists ((v_ArrVal_3014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3014)))) is different from true [2022-12-13 12:52:36,229 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3017))) (exists ((v_ArrVal_3016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3016)))) is different from true [2022-12-13 12:52:36,324 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3024 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3024) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3025)))) is different from true [2022-12-13 12:52:36,362 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3028) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3029) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:52:36,373 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3030))) (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-12-13 12:52:36,407 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3034)))) is different from true [2022-12-13 12:52:36,416 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3036) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3037)))) is different from true [2022-12-13 12:52:36,425 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:52:36,437 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_3041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3041) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:52:36,447 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043)))) is different from true [2022-12-13 12:52:36,457 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044)))) is different from true [2022-12-13 12:52:36,498 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-12-13 12:52:36,507 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050)))) is different from true [2022-12-13 12:52:36,539 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055)))) is different from true [2022-12-13 12:52:36,548 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:52:36,581 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060)))) is different from true [2022-12-13 12:52:36,592 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3062))) (exists ((v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3063)))) is different from true [2022-12-13 12:52:36,602 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064)))) is different from true [2022-12-13 12:52:36,614 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:52:36,624 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069))) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:52:36,635 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070)))) is different from true [2022-12-13 12:52:36,677 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075))) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074)))) is different from true [2022-12-13 12:52:36,743 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081)))) is different from true [2022-12-13 12:52:36,777 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:52:36,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:52:36,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 12:52:36,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-13 12:52:36,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 12:52:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 885 not checked. [2022-12-13 12:52:36,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:52:37,502 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3173 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-12-13 12:52:37,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1866302110] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:52:37,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:52:37,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 38] total 83 [2022-12-13 12:52:37,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500548085] [2022-12-13 12:52:37,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:52:37,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-12-13 12:52:37,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:52:37,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-12-13 12:52:37,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=234, Unknown=83, NotChecked=7154, Total=7656 [2022-12-13 12:52:37,511 INFO L87 Difference]: Start difference. First operand 1230 states and 1375 transitions. Second operand has 84 states, 81 states have (on average 2.567901234567901) internal successors, (208), 84 states have internal predecessors, (208), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:52:38,694 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_2997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2997))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (exists ((v_ArrVal_3006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3006) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3015))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_2996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2996))) (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075))) (exists ((v_ArrVal_3014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3014))) (exists ((v_ArrVal_3028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3028) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3024 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3024) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3029) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459))) (exists ((v_ArrVal_3025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3025))) (exists ((v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3007))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3034))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464))) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-12-13 12:52:38,706 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3062))) (exists ((v_ArrVal_3009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3009))) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (exists ((v_ArrVal_3006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3006) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3030))) (exists ((v_ArrVal_3015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3015))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3017))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075))) (exists ((v_ArrVal_3014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3014))) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_3028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3028) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3024 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3024) |c_#memory_$Pointer$.base|)) (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_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3008))) (exists ((v_ArrVal_3029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3029) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3036) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3016))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465))) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3025))) (exists ((v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3007))) (exists ((v_ArrVal_3037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3037))) (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_2998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2998))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3063))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2999))) (exists ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3034))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464))) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-12-13 12:52:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:52:58,698 INFO L93 Difference]: Finished difference Result 2013 states and 2152 transitions. [2022-12-13 12:52:58,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 12:52:58,699 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 81 states have (on average 2.567901234567901) internal successors, (208), 84 states have internal predecessors, (208), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2022-12-13 12:52:58,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:52:58,704 INFO L225 Difference]: With dead ends: 2013 [2022-12-13 12:52:58,704 INFO L226 Difference]: Without dead ends: 2013 [2022-12-13 12:52:58,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 121 SyntacticMatches, 22 SemanticMatches, 95 ConstructedPredicates, 75 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=248, Invalid=422, Unknown=92, NotChecked=8550, Total=9312 [2022-12-13 12:52:58,705 INFO L413 NwaCegarLoop]: 847 mSDtfsCounter, 1854 mSDsluCounter, 4224 mSDsCounter, 0 mSdLazyCounter, 10051 mSolverCounterSat, 32 mSolverCounterUnsat, 719 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1874 SdHoareTripleChecker+Valid, 5071 SdHoareTripleChecker+Invalid, 119049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 10051 IncrementalHoareTripleChecker+Invalid, 719 IncrementalHoareTripleChecker+Unknown, 108247 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:52:58,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1874 Valid, 5071 Invalid, 119049 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 10051 Invalid, 719 Unknown, 108247 Unchecked, 20.4s Time] [2022-12-13 12:52:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2022-12-13 12:52:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1229. [2022-12-13 12:52:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 812 states have (on average 1.6502463054187193) internal successors, (1340), 1218 states have internal predecessors, (1340), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 12:52:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1374 transitions. [2022-12-13 12:52:58,717 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1374 transitions. Word has length 110 [2022-12-13 12:52:58,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:52:58,718 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 1374 transitions. [2022-12-13 12:52:58,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 81 states have (on average 2.567901234567901) internal successors, (208), 84 states have internal predecessors, (208), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:52:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1374 transitions. [2022-12-13 12:52:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-13 12:52:58,718 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:52:58,718 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:52:58,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2022-12-13 12:52:58,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-12-13 12:52:59,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:52:59,120 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:52:59,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:59,121 INFO L85 PathProgramCache]: Analyzing trace with hash -239903209, now seen corresponding path program 1 times [2022-12-13 12:52:59,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:52:59,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692732513] [2022-12-13 12:52:59,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:59,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:52:59,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:52:59,125 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:52:59,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-12-13 12:52:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:59,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-13 12:52:59,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:52:59,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 12:52:59,994 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 12:52:59,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 12:53:00,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:53:00,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-13 12:53:00,164 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_39 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_39 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_39) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3536)))) is different from true [2022-12-13 12:53:00,633 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_39 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_39 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_39) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553)))) is different from true [2022-12-13 12:53:01,408 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:53:01,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-13 12:53:01,496 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:53:01,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-13 12:53:01,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-13 12:53:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-12-13 12:53:01,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:53:01,616 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3580) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2022-12-13 12:53:01,626 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-13 12:53:01,829 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3626))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3580)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 12:53:01,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:53:01,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692732513] [2022-12-13 12:53:01,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692732513] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:53:01,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [929897000] [2022-12-13 12:53:01,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:01,833 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 12:53:01,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 12:53:01,833 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 12:53:01,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-12-13 12:53:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:04,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-13 12:53:04,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:53:04,922 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 12:53:04,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 12:53:05,144 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-12-13 12:53:05,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-12-13 12:53:05,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:53:05,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-12-13 12:53:07,951 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:53:07,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:53:08,121 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:53:08,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:53:08,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-12-13 12:53:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-12-13 12:53:08,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:53:08,228 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4033) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 12:53:08,238 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-13 12:53:08,437 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4033)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 12:53:08,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [929897000] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:53:08,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:53:08,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 20 [2022-12-13 12:53:08,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131720163] [2022-12-13 12:53:08,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:53:08,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 12:53:08,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:53:08,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 12:53:08,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=322, Unknown=33, NotChecked=360, Total=812 [2022-12-13 12:53:08,441 INFO L87 Difference]: Start difference. First operand 1229 states and 1374 transitions. Second operand has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 21 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:53:22,187 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_39 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_39 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_39) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3537))) (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553)))) is different from true [2022-12-13 12:53:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:23,534 INFO L93 Difference]: Finished difference Result 2269 states and 2452 transitions. [2022-12-13 12:53:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 12:53:23,535 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 21 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2022-12-13 12:53:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:23,538 INFO L225 Difference]: With dead ends: 2269 [2022-12-13 12:53:23,538 INFO L226 Difference]: Without dead ends: 2269 [2022-12-13 12:53:23,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 125 SyntacticMatches, 89 SemanticMatches, 34 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=152, Invalid=543, Unknown=43, NotChecked=522, Total=1260 [2022-12-13 12:53:23,539 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 3359 mSDsluCounter, 3676 mSDsCounter, 0 mSdLazyCounter, 4761 mSolverCounterSat, 69 mSolverCounterUnsat, 1871 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3389 SdHoareTripleChecker+Valid, 4209 SdHoareTripleChecker+Invalid, 8890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 4761 IncrementalHoareTripleChecker+Invalid, 1871 IncrementalHoareTripleChecker+Unknown, 2189 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-12-13 12:53:23,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3389 Valid, 4209 Invalid, 8890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 4761 Invalid, 1871 Unknown, 2189 Unchecked, 14.6s Time] [2022-12-13 12:53:23,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2022-12-13 12:53:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1228. [2022-12-13 12:53:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 812 states have (on average 1.6490147783251232) internal successors, (1339), 1217 states have internal predecessors, (1339), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 12:53:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1373 transitions. [2022-12-13 12:53:23,552 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1373 transitions. Word has length 113 [2022-12-13 12:53:23,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:23,552 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 1373 transitions. [2022-12-13 12:53:23,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 21 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:53:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1373 transitions. [2022-12-13 12:53:23,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-13 12:53:23,553 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:23,553 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:53:23,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-12-13 12:53:23,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-12-13 12:53:23,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 12:53:23,954 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:53:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash -239903208, now seen corresponding path program 1 times [2022-12-13 12:53:23,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:53:23,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277747653] [2022-12-13 12:53:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:23,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:53:23,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:53:23,961 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:53:23,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-12-13 12:53:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:25,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-13 12:53:25,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:53:25,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 12:53:25,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:53:25,153 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 12:53:25,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 12:53:25,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:53:25,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:53:25,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 12:53:25,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-13 12:53:25,293 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4445))) (exists ((v_ArrVal_4444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4444)))) is different from true [2022-12-13 12:53:25,330 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4449) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4448)))) is different from true [2022-12-13 12:53:25,339 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:53:25,400 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457)))) is different from true [2022-12-13 12:53:25,463 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4462))) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:53:25,473 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4464) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:53:25,482 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4467))) (exists ((v_ArrVal_4466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4466)))) is different from true [2022-12-13 12:53:25,491 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4469))) (exists ((v_ArrVal_4468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4468)))) is different from true [2022-12-13 12:53:25,500 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471)))) is different from true [2022-12-13 12:53:25,509 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4473))) (exists ((v_ArrVal_4472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4472)))) is different from true [2022-12-13 12:53:25,519 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:53:25,529 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:53:25,537 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4478))) (exists ((v_ArrVal_4479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4479) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:53:25,547 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4480))) (exists ((v_ArrVal_4481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4481) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:53:25,557 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4483)))) is different from true [2022-12-13 12:53:25,566 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4484))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4485)))) is different from true [2022-12-13 12:53:25,575 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4486) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4487)))) is different from true [2022-12-13 12:53:25,584 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4489))) (exists ((v_ArrVal_4488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4488)))) is different from true [2022-12-13 12:53:25,593 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4491))) (exists ((v_ArrVal_4490 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4490) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:53:25,603 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4492))) (exists ((v_ArrVal_4493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4493) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:53:25,615 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4494))) (exists ((v_ArrVal_4495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4495)))) is different from true [2022-12-13 12:53:25,626 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4497))) (exists ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4496)))) is different from true [2022-12-13 12:53:25,637 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4498))) (exists ((v_ArrVal_4499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4499)))) is different from true [2022-12-13 12:53:25,651 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4500))) (exists ((v_ArrVal_4501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4501)))) is different from true [2022-12-13 12:53:25,662 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4503))) (exists ((v_ArrVal_4502 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4502) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:53:25,673 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4504) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4505 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4505)))) is different from true [2022-12-13 12:53:25,685 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4507))) (exists ((v_ArrVal_4506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4506)))) is different from true [2022-12-13 12:53:25,696 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4508)))) is different from true [2022-12-13 12:53:25,706 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4511))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4510)))) is different from true [2022-12-13 12:53:25,717 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4512))) (exists ((v_ArrVal_4513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4513)))) is different from true [2022-12-13 12:53:25,727 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4514) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4515) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:53:25,738 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4516))) (exists ((v_ArrVal_4517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4517)))) is different from true [2022-12-13 12:53:25,748 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4519))) (exists ((v_ArrVal_4518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4518)))) is different from true [2022-12-13 12:53:25,759 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4520) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4521)))) is different from true [2022-12-13 12:53:25,770 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4523) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4522)))) is different from true [2022-12-13 12:53:25,781 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4525))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4524)))) is different from true [2022-12-13 12:53:25,792 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4527) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4526)))) is different from true [2022-12-13 12:53:25,803 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4528 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4528))) (exists ((v_ArrVal_4529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4529)))) is different from true [2022-12-13 12:53:25,814 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4531))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4530)))) is different from true [2022-12-13 12:53:25,862 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:53:25,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:53:25,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 12:53:25,951 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:53:25,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:53:25,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 12:53:25,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 12:53:25,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-13 12:53:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 975 not checked. [2022-12-13 12:53:26,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:53:26,184 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-12-13 12:53:26,220 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-12-13 12:53:27,014 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4624) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4625) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4625))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4624) .cse2 v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-13 12:53:27,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:53:27,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277747653] [2022-12-13 12:53:27,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277747653] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:53:27,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [374291490] [2022-12-13 12:53:27,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:27,030 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 12:53:27,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 12:53:27,030 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 12:53:27,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-12-13 12:55:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:55:27,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 113 conjunts are in the unsatisfiable core [2022-12-13 12:55:27,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:55:27,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 12:55:27,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:55:27,921 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 12:55:27,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 12:55:27,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:55:27,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:55:27,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 12:55:27,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-13 12:55:28,018 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4991) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4990)))) is different from true [2022-12-13 12:55:28,027 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4993))) (exists ((v_ArrVal_4992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4992)))) is different from true [2022-12-13 12:55:28,038 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4995))) (exists ((v_ArrVal_4994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4994) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:55:28,047 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4997))) (exists ((v_ArrVal_4996 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4996) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:55:28,060 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4999))) (exists ((v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4998)))) is different from true [2022-12-13 12:55:28,070 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5001))) (exists ((v_ArrVal_5000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5000))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32)))) is different from true [2022-12-13 12:55:28,081 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5002))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5003 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5003)))) is different from true [2022-12-13 12:55:28,091 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5005))) (exists ((v_ArrVal_5004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5004) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:55:28,100 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5007))) (exists ((v_ArrVal_5006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5006)))) is different from true [2022-12-13 12:55:28,111 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5009) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5008)))) is different from true [2022-12-13 12:55:28,120 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5011) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5010) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:55:28,129 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5013))) (exists ((v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5012)))) is different from true [2022-12-13 12:55:28,137 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5014))) (exists ((v_ArrVal_5015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5015)))) is different from true [2022-12-13 12:55:28,146 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5016 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5016) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5017)))) is different from true [2022-12-13 12:55:28,155 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5019) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5018) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:55:28,163 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5021))) (exists ((v_ArrVal_5020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5020)))) is different from true [2022-12-13 12:55:28,172 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5023 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5023) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5022) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:55:28,181 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5024))) (exists ((v_ArrVal_5025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5025)))) is different from true [2022-12-13 12:55:28,190 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5026))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5027)))) is different from true [2022-12-13 12:55:28,219 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5031) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5030)))) is different from true [2022-12-13 12:55:28,229 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5032 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5032))) (exists ((v_ArrVal_5033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5033)))) is different from true [2022-12-13 12:55:28,238 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5034))) (exists ((v_ArrVal_5035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5035)))) is different from true [2022-12-13 12:55:28,246 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5036))) (exists ((v_ArrVal_5037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5037)))) is different from true [2022-12-13 12:55:28,254 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5039 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5039) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5038)))) is different from true [2022-12-13 12:55:28,263 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5040) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5041)))) is different from true [2022-12-13 12:55:28,271 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5043))) (exists ((v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5042) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:55:28,279 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5044 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5044) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5045)))) is different from true [2022-12-13 12:55:28,287 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5046))) (exists ((v_ArrVal_5047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5047)))) is different from true [2022-12-13 12:55:28,295 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5048) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5049) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:55:28,303 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5050) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5051) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:55:28,312 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5053) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5052) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:55:28,321 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5055))) (exists ((v_ArrVal_5054 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5054) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:55:28,330 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5057) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5056)))) is different from true [2022-12-13 12:55:28,338 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5058))) (exists ((v_ArrVal_5059 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5059) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:55:28,346 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5061 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5061))) (exists ((v_ArrVal_5060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5060)))) is different from true [2022-12-13 12:55:28,355 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5062))) (exists ((v_ArrVal_5063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5063)))) is different from true [2022-12-13 12:55:28,363 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5065))) (exists ((v_ArrVal_5064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5064)))) is different from true [2022-12-13 12:55:28,374 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5066))) (exists ((v_ArrVal_5067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5067)))) is different from true [2022-12-13 12:55:28,383 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5068) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5069)))) is different from true [2022-12-13 12:55:28,391 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5071) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5070) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:55:28,400 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5072))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5073) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:55:28,408 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5075) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5074)))) is different from true [2022-12-13 12:55:28,416 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5076))) (exists ((v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5077)))) is different from true [2022-12-13 12:55:28,448 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:55:28,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:55:28,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 12:55:28,504 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:55:28,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:55:28,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 12:55:28,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 12:55:28,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-13 12:55:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-12-13 12:55:28,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:55:28,600 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5078 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 12:55:28,632 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5078 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-13 12:55:29,351 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5170))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5171) .cse0 v_ArrVal_5078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5078 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5171) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-12-13 12:55:29,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [374291490] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:55:29,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:55:29,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 52] total 91 [2022-12-13 12:55:29,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308623065] [2022-12-13 12:55:29,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:55:29,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-12-13 12:55:29,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:55:29,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-12-13 12:55:29,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=186, Unknown=95, NotChecked=9416, Total=9900 [2022-12-13 12:55:29,363 INFO L87 Difference]: Start difference. First operand 1228 states and 1373 transitions. Second operand has 92 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 92 states have internal predecessors, (156), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:55:30,182 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4991) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4447))) (exists ((v_ArrVal_4445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4445))) (exists ((v_ArrVal_4446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4446) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4990))) (exists ((v_ArrVal_4444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4444)))) is different from true [2022-12-13 12:55:30,230 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4449) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4448))) (exists ((v_ArrVal_4447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4447))) (exists ((v_ArrVal_5031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5031) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5032 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5032))) (exists ((v_ArrVal_5030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5030))) (exists ((v_ArrVal_4462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4462))) (exists ((v_ArrVal_4446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4446) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4464) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4995))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457))) (exists ((v_ArrVal_4994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5033)))) is different from true [2022-12-13 12:55:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:55:39,696 INFO L93 Difference]: Finished difference Result 1291 states and 1392 transitions. [2022-12-13 12:55:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 12:55:39,697 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 92 states have internal predecessors, (156), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 113 [2022-12-13 12:55:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:55:39,699 INFO L225 Difference]: With dead ends: 1291 [2022-12-13 12:55:39,699 INFO L226 Difference]: Without dead ends: 1291 [2022-12-13 12:55:39,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 132 SyntacticMatches, 10 SemanticMatches, 107 ConstructedPredicates, 90 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=252, Invalid=346, Unknown=104, NotChecked=11070, Total=11772 [2022-12-13 12:55:39,701 INFO L413 NwaCegarLoop]: 539 mSDtfsCounter, 933 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 3987 mSolverCounterSat, 18 mSolverCounterUnsat, 522 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 90707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3987 IncrementalHoareTripleChecker+Invalid, 522 IncrementalHoareTripleChecker+Unknown, 86180 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-12-13 12:55:39,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1953 Invalid, 90707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3987 Invalid, 522 Unknown, 86180 Unchecked, 9.9s Time] [2022-12-13 12:55:39,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2022-12-13 12:55:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1237. [2022-12-13 12:55:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 820 states have (on average 1.6439024390243901) internal successors, (1348), 1225 states have internal predecessors, (1348), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (19), 8 states have call predecessors, (19), 16 states have call successors, (19) [2022-12-13 12:55:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1383 transitions. [2022-12-13 12:55:39,715 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1383 transitions. Word has length 113 [2022-12-13 12:55:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:55:39,716 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 1383 transitions. [2022-12-13 12:55:39,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 92 states have internal predecessors, (156), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:55:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1383 transitions. [2022-12-13 12:55:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-13 12:55:39,717 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:55:39,717 INFO L195 NwaCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:55:39,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-12-13 12:55:39,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2022-12-13 12:55:40,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 12:55:40,119 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:55:40,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:55:40,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1106744473, now seen corresponding path program 2 times [2022-12-13 12:55:40,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:55:40,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832631423] [2022-12-13 12:55:40,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:55:40,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:55:40,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:55:40,123 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:55:40,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-12-13 12:55:40,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:55:40,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:55:40,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-13 12:55:40,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:55:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:55:42,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:55:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 1 proven. 1034 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:55:53,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:55:53,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832631423] [2022-12-13 12:55:53,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832631423] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:55:53,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:55:53,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 96 [2022-12-13 12:55:53,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543954726] [2022-12-13 12:55:53,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:55:53,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-12-13 12:55:53,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:55:53,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-12-13 12:55:53,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2355, Invalid=6765, Unknown=0, NotChecked=0, Total=9120 [2022-12-13 12:55:53,620 INFO L87 Difference]: Start difference. First operand 1237 states and 1383 transitions. Second operand has 96 states, 96 states have (on average 1.6666666666666667) internal successors, (160), 96 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:56:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:12,756 INFO L93 Difference]: Finished difference Result 1351 states and 1601 transitions. [2022-12-13 12:56:12,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-12-13 12:56:12,756 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.6666666666666667) internal successors, (160), 96 states have internal predecessors, (160), 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 114 [2022-12-13 12:56:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:12,759 INFO L225 Difference]: With dead ends: 1351 [2022-12-13 12:56:12,759 INFO L226 Difference]: Without dead ends: 1334 [2022-12-13 12:56:12,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2025 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=4656, Invalid=15366, Unknown=0, NotChecked=0, Total=20022 [2022-12-13 12:56:12,762 INFO L413 NwaCegarLoop]: 1078 mSDtfsCounter, 148 mSDsluCounter, 51210 mSDsCounter, 0 mSdLazyCounter, 12219 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 52288 SdHoareTripleChecker+Invalid, 12290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 12219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:12,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 52288 Invalid, 12290 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [71 Valid, 12219 Invalid, 0 Unknown, 0 Unchecked, 16.8s Time] [2022-12-13 12:56:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-12-13 12:56:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1250. [2022-12-13 12:56:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 835 states have (on average 1.652694610778443) internal successors, (1380), 1239 states have internal predecessors, (1380), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 12:56:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1414 transitions. [2022-12-13 12:56:12,784 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1414 transitions. Word has length 114 [2022-12-13 12:56:12,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:12,785 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1414 transitions. [2022-12-13 12:56:12,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.6666666666666667) internal successors, (160), 96 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:56:12,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1414 transitions. [2022-12-13 12:56:12,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 12:56:12,786 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:12,786 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:12,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-12-13 12:56:12,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:56:12,987 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:56:12,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:12,987 INFO L85 PathProgramCache]: Analyzing trace with hash -130639707, now seen corresponding path program 1 times [2022-12-13 12:56:12,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:56:12,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526829082] [2022-12-13 12:56:12,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:12,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:56:12,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:56:12,990 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:56:12,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-12-13 12:56:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:13,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-13 12:56:13,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:56:13,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 12:56:14,082 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 12:56:14,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 12:56:14,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:56:14,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-13 12:56:14,266 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5913)))) is different from true [2022-12-13 12:56:14,313 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5915) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:56:15,066 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5941) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:56:15,325 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5951)))) is different from true [2022-12-13 12:56:15,452 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5956)))) is different from true [2022-12-13 12:56:15,492 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:56:15,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-13 12:56:15,594 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:56:15,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-13 12:56:15,681 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:56:15,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-13 12:56:15,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-13 12:56:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 741 trivial. 210 not checked. [2022-12-13 12:56:15,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:56:15,796 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5958 (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~mem36#1.base| v_ArrVal_5958) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2022-12-13 12:56:15,808 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-12-13 12:56:15,825 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5957))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5958)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 12:56:15,838 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5957))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5958)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 12:56:16,059 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6004))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5957)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5958)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 12:56:16,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:56:16,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526829082] [2022-12-13 12:56:16,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526829082] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:56:16,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1968191501] [2022-12-13 12:56:16,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:16,062 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 12:56:16,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 12:56:16,063 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 12:56:16,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-12-13 12:56:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:42,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-13 12:56:42,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:56:42,753 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 12:56:42,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 12:56:42,996 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-12-13 12:56:42,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-12-13 12:56:43,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:56:43,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-12-13 12:56:46,021 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:56:46,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:56:46,218 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:56:46,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:56:46,366 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:56:46,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:56:46,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-12-13 12:56:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-12-13 12:56:46,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:56:48,581 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6427) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2022-12-13 12:56:48,600 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6426))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6427)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 12:56:48,613 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6426))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6427)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 12:56:48,879 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6473 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6473))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6426)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6427)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 12:56:48,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1968191501] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:56:48,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:56:48,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 25 [2022-12-13 12:56:48,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314216587] [2022-12-13 12:56:48,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:56:48,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 12:56:48,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:56:48,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 12:56:48,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=435, Unknown=46, NotChecked=798, Total=1406 [2022-12-13 12:56:48,885 INFO L87 Difference]: Start difference. First operand 1250 states and 1414 transitions. Second operand has 26 states, 23 states have (on average 6.608695652173913) internal successors, (152), 26 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:57:04,600 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5914) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5913)))) is different from true [2022-12-13 12:57:04,615 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5914) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5941) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5956))) (exists ((v_ArrVal_5951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5951))) (exists ((v_ArrVal_5915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5915) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:57:06,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:57:06,105 INFO L93 Difference]: Finished difference Result 2311 states and 2532 transitions. [2022-12-13 12:57:06,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 12:57:06,106 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.608695652173913) internal successors, (152), 26 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 116 [2022-12-13 12:57:06,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:57:06,109 INFO L225 Difference]: With dead ends: 2311 [2022-12-13 12:57:06,109 INFO L226 Difference]: Without dead ends: 2311 [2022-12-13 12:57:06,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 131 SyntacticMatches, 86 SemanticMatches, 44 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=184, Invalid=693, Unknown=57, NotChecked=1136, Total=2070 [2022-12-13 12:57:06,109 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 3337 mSDsluCounter, 4614 mSDsCounter, 0 mSdLazyCounter, 5646 mSolverCounterSat, 72 mSolverCounterUnsat, 1942 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3367 SdHoareTripleChecker+Valid, 5146 SdHoareTripleChecker+Invalid, 13761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 5646 IncrementalHoareTripleChecker+Invalid, 1942 IncrementalHoareTripleChecker+Unknown, 6101 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2022-12-13 12:57:06,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3367 Valid, 5146 Invalid, 13761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 5646 Invalid, 1942 Unknown, 6101 Unchecked, 16.7s Time] [2022-12-13 12:57:06,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-12-13 12:57:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1249. [2022-12-13 12:57:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 835 states have (on average 1.6514970059880238) internal successors, (1379), 1238 states have internal predecessors, (1379), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 12:57:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1413 transitions. [2022-12-13 12:57:06,121 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1413 transitions. Word has length 116 [2022-12-13 12:57:06,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:57:06,121 INFO L495 AbstractCegarLoop]: Abstraction has 1249 states and 1413 transitions. [2022-12-13 12:57:06,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.608695652173913) internal successors, (152), 26 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:57:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1413 transitions. [2022-12-13 12:57:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 12:57:06,121 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:57:06,122 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:57:06,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2022-12-13 12:57:06,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-12-13 12:57:06,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:57:06,524 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:57:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:57:06,525 INFO L85 PathProgramCache]: Analyzing trace with hash -130639706, now seen corresponding path program 1 times [2022-12-13 12:57:06,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:57:06,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550698516] [2022-12-13 12:57:06,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:57:06,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:57:06,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:57:06,527 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:57:06,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-12-13 12:57:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:57:07,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 115 conjunts are in the unsatisfiable core [2022-12-13 12:57:07,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:57:07,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 12:57:07,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:57:07,720 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 12:57:07,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 12:57:07,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:57:07,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:57:07,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 12:57:07,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-13 12:57:07,908 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6854) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6853))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:07,918 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6855))) (exists ((v_ArrVal_6856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6856))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:07,929 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6857) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6858))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:07,939 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6859))) (exists ((v_ArrVal_6860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6860))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:07,984 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6864))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_6863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6863)))) is different from true [2022-12-13 12:57:08,019 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6867))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_6868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6868)))) is different from true [2022-12-13 12:57:08,078 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6874))) (exists ((v_ArrVal_6873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6873) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,086 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6876 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6876) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_6875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6875)))) is different from true [2022-12-13 12:57:08,123 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6880))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_6879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6879) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:57:08,134 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6881 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6881) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6882))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,144 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6883))) (exists ((v_ArrVal_6884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6884))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,155 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6885 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6885) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6886))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,166 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6888 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6888) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6887))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,176 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6890 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6890) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6889))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,187 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6892))) (exists ((v_ArrVal_6891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6891))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,198 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6893) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6894 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6894) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,209 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6896))) (exists ((v_ArrVal_6895 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6895))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,219 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6898 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6898))) (exists ((v_ArrVal_6897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6897))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,230 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6900 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6900))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_6899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6899)))) is different from true [2022-12-13 12:57:08,241 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6902))) (exists ((v_ArrVal_6901 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6901))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,251 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6904))) (exists ((v_ArrVal_6903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6903))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,261 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6905))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_6906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6906)))) is different from true [2022-12-13 12:57:08,269 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6908))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_6907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6907)))) is different from true [2022-12-13 12:57:08,279 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6909))) (exists ((v_ArrVal_6910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6910) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,288 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6911) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6912))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,300 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6913))) (exists ((v_ArrVal_6914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6914))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,311 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6915))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_6916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6916)))) is different from true [2022-12-13 12:57:08,319 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6918))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,330 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6919))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_6920 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6920) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:57:08,339 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6921) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_6922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6922)))) is different from true [2022-12-13 12:57:08,352 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6924 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6924) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6923))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,362 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6925))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_6926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6926)))) is different from true [2022-12-13 12:57:08,372 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6928))) (exists ((v_ArrVal_6927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6927))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,382 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6929))) (exists ((v_ArrVal_6930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6930))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,395 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6932))) (exists ((v_ArrVal_6931 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6931) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,404 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934))) (exists ((v_ArrVal_6933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6933) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,414 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_6936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6936)))) is different from true [2022-12-13 12:57:08,424 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6937) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6938))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,435 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6939) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6940) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:57:08,472 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:57:08,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:57:08,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 12:57:08,585 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:57:08,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:57:08,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 12:57:08,674 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:57:08,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:57:08,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 12:57:08,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 12:57:08,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-13 12:57:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 975 not checked. [2022-12-13 12:57:08,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:57:08,911 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6944 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6943) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6944) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6943) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-12-13 12:57:08,940 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6943) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6944 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6943) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6944) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-13 12:57:08,988 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6941) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6942) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6943) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6944 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6942))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6941) .cse2 v_ArrVal_6943) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6944) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-13 12:57:09,036 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6944 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6942))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6941) .cse1 v_ArrVal_6943) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6944) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6941) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6942) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6943) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-12-13 12:57:09,652 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6944 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7035 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7036 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7035))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6942))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7036) .cse0 v_ArrVal_6941) .cse1 v_ArrVal_6943) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6944) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7035 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7036 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7035))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7036) .cse6 v_ArrVal_6941) (select (select (store .cse7 .cse6 v_ArrVal_6942) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6943))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-12-13 12:57:09,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:57:09,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550698516] [2022-12-13 12:57:09,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550698516] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:57:09,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1936337696] [2022-12-13 12:57:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:57:09,665 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 12:57:09,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 12:57:09,665 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 12:57:09,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-12-13 12:58:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:16,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 117 conjunts are in the unsatisfiable core [2022-12-13 12:58:16,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:58:16,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 12:58:16,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:58:16,172 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 12:58:16,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 12:58:16,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:58:16,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:58:16,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 12:58:16,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-13 12:58:16,287 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7417) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7416))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,295 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7418 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7418) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7419)))) is different from true [2022-12-13 12:58:16,327 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7423) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7422 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7422) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,339 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7425 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7425) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7424)))) is different from true [2022-12-13 12:58:16,349 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7426))) (exists ((v_ArrVal_7427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7427))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,358 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7429))) (exists ((v_ArrVal_7428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7428))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,367 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7430) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7431))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,376 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7432))) (exists ((v_ArrVal_7433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7433)))) is different from true [2022-12-13 12:58:16,386 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7435 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7435) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7434)))) is different from true [2022-12-13 12:58:16,395 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7437))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7436 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7436) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:58:16,405 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7439 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7439) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7438))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,414 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7440))) (exists ((v_ArrVal_7441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7441))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,423 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7442) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7443 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7443) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,433 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7444))) (exists ((v_ArrVal_7445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7445))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,443 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7446))) (exists ((v_ArrVal_7447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7447))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,452 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7449))) (exists ((v_ArrVal_7448 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7448) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,461 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7451) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7450) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,469 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7453))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7452)))) is different from true [2022-12-13 12:58:16,478 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7455))) (exists ((v_ArrVal_7454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7454))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,487 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7456))) (exists ((v_ArrVal_7457 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7457) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,495 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7459))) (exists ((v_ArrVal_7458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7458))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,503 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7461))) (exists ((v_ArrVal_7460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7460))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,512 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7462 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7462) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7463)))) is different from true [2022-12-13 12:58:16,521 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7464) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7465) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:58:16,530 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7467))) (exists ((v_ArrVal_7466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7466))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,539 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7469))) (exists ((v_ArrVal_7468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7468))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,549 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7470 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7470))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7471)))) is different from true [2022-12-13 12:58:16,559 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7473))) (exists ((v_ArrVal_7472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7472))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,568 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7475))) (exists ((v_ArrVal_7474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7474))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,578 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7477))) (exists ((v_ArrVal_7476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7476) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,587 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7478))) (exists ((v_ArrVal_7479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7479))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,606 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7481) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7480))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,614 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7483))) (exists ((v_ArrVal_7482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7482) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:58:16,623 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7484) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7485 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7485) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:58:16,634 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7487) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7486) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:58:16,645 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7489))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7488)))) is different from true [2022-12-13 12:58:16,655 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7490 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7490) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7491)))) is different from true [2022-12-13 12:58:16,666 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7493 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7493))) (exists ((v_ArrVal_7492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7492))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,677 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7495))) (exists ((v_ArrVal_7494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7494))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,686 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7497) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7496))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,697 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7498))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7499)))) is different from true [2022-12-13 12:58:16,706 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7500))) (exists ((v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7501))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,714 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7503))) (exists ((v_ArrVal_7502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7502))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:16,746 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:58:16,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:58:16,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 12:58:16,814 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:58:16,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:58:16,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 12:58:16,866 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:58:16,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:58:16,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 12:58:16,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 12:58:16,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-13 12:58:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-12-13 12:58:16,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:58:16,952 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7507 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 12:58:16,980 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7507 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-13 12:58:17,107 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7505) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7507 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7504))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7505) .cse2 v_ArrVal_7506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-13 12:58:17,239 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7507 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7504))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7505) .cse1 v_ArrVal_7506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7505) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-12-13 12:58:17,913 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7598 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7598))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7504))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7599) .cse0 v_ArrVal_7505) .cse1 v_ArrVal_7506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7598 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7598))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7599) .cse6 v_ArrVal_7505) (select (select (store .cse7 .cse6 v_ArrVal_7504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7506))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-12-13 12:58:17,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1936337696] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:58:17,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:58:17,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 53] total 92 [2022-12-13 12:58:17,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009642345] [2022-12-13 12:58:17,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:58:17,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-12-13 12:58:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:58:17,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-12-13 12:58:17,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=209, Unknown=100, NotChecked=10396, Total=10920 [2022-12-13 12:58:17,927 INFO L87 Difference]: Start difference. First operand 1249 states and 1413 transitions. Second operand has 93 states, 91 states have (on average 1.7582417582417582) internal successors, (160), 93 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:58:18,689 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6862) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6854) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7417) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6853))) (exists ((v_ArrVal_7416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7416))) (exists ((v_ArrVal_6861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6861))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2022-12-13 12:58:18,694 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6874))) (exists ((v_ArrVal_6862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6862) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7423) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6855))) (exists ((v_ArrVal_6867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6867))) (exists ((v_ArrVal_6880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6880))) (exists ((v_ArrVal_7422 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7422) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7418 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7418) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6864))) (exists ((v_ArrVal_6856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6856))) (exists ((v_ArrVal_6861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6861))) (exists ((v_ArrVal_6873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6873) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_6863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6863))) (exists ((v_ArrVal_6879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6879) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7419))) (exists ((v_ArrVal_6868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6868)))) is different from true [2022-12-13 12:58:18,700 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6874))) (exists ((v_ArrVal_6862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6862) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7423) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7425 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7425) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6867))) (exists ((v_ArrVal_6876 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6876) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6880))) (exists ((v_ArrVal_6881 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6881) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7422 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7422) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6864))) (exists ((v_ArrVal_6882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6882))) (exists ((v_ArrVal_6857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6857) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6861))) (exists ((v_ArrVal_6873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6873) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6858))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_6863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6863))) (exists ((v_ArrVal_6879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6879) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6875))) (exists ((v_ArrVal_6868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6868))) (exists ((v_ArrVal_7424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7424)))) is different from true [2022-12-13 12:58:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:58:28,414 INFO L93 Difference]: Finished difference Result 1301 states and 1420 transitions. [2022-12-13 12:58:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 12:58:28,414 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 91 states have (on average 1.7582417582417582) internal successors, (160), 93 states have internal predecessors, (160), 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 116 [2022-12-13 12:58:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:58:28,417 INFO L225 Difference]: With dead ends: 1301 [2022-12-13 12:58:28,417 INFO L226 Difference]: Without dead ends: 1301 [2022-12-13 12:58:28,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 139 SyntacticMatches, 10 SemanticMatches, 114 ConstructedPredicates, 95 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=273, Invalid=416, Unknown=111, NotChecked=12540, Total=13340 [2022-12-13 12:58:28,418 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 923 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 4006 mSolverCounterSat, 18 mSolverCounterUnsat, 488 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 90109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4006 IncrementalHoareTripleChecker+Invalid, 488 IncrementalHoareTripleChecker+Unknown, 85597 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:58:28,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1953 Invalid, 90109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4006 Invalid, 488 Unknown, 85597 Unchecked, 10.0s Time] [2022-12-13 12:58:28,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2022-12-13 12:58:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1248. [2022-12-13 12:58:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 835 states have (on average 1.6502994011976049) internal successors, (1378), 1237 states have internal predecessors, (1378), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 12:58:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1412 transitions. [2022-12-13 12:58:28,426 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1412 transitions. Word has length 116 [2022-12-13 12:58:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:58:28,426 INFO L495 AbstractCegarLoop]: Abstraction has 1248 states and 1412 transitions. [2022-12-13 12:58:28,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 91 states have (on average 1.7582417582417582) internal successors, (160), 93 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:58:28,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1412 transitions. [2022-12-13 12:58:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-13 12:58:28,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:58:28,427 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] [2022-12-13 12:58:28,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-12-13 12:58:28,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2022-12-13 12:58:28,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 12:58:28,829 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 12:58:28,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:28,830 INFO L85 PathProgramCache]: Analyzing trace with hash -646855042, now seen corresponding path program 1 times [2022-12-13 12:58:28,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:58:28,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190783750] [2022-12-13 12:58:28,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:28,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:58:28,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:58:28,832 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:58:28,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-12-13 12:58:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:30,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-13 12:58:30,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:58:30,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 12:58:30,268 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 12:58:30,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 12:58:30,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:58:30,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-13 12:58:30,447 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| v_arrayElimCell_113) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_7992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7992) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:58:30,527 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| v_arrayElimCell_113) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_7995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7995) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:58:30,601 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| v_arrayElimCell_113) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_7998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7998)))) is different from true [2022-12-13 12:58:30,641 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| v_arrayElimCell_113) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8000)))) is different from true [2022-12-13 12:58:30,687 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| v_arrayElimCell_113) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8002)))) is different from true [2022-12-13 12:58:30,766 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| v_arrayElimCell_113) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8005)))) is different from true [2022-12-13 12:58:30,811 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| v_arrayElimCell_113) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8007)))) is different from true [2022-12-13 12:58:31,117 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| v_arrayElimCell_113) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8018)))) is different from true [2022-12-13 12:58:31,219 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| v_arrayElimCell_113) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8022) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 12:58:31,260 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| v_arrayElimCell_113) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8024)))) is different from true [2022-12-13 12:58:31,502 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| v_arrayElimCell_113) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8033)))) is different from true [2022-12-13 12:58:31,597 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:58:31,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-13 12:58:31,697 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:58:31,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-13 12:58:31,785 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:58:31,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-13 12:58:31,869 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:58:31,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-13 12:58:31,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-13 12:58:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 528 trivial. 429 not checked. [2022-12-13 12:58:31,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:58:32,390 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-13 12:58:32,405 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8037 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8037))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8038)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 12:58:32,417 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8037 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8037))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8038)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 12:58:32,437 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8037 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8036))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8037)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8038)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 12:58:32,453 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8037 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8036))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8037)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8038)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 12:58:32,705 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8037 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8084))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8036)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8037)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8038)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-12-13 12:58:32,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:58:32,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190783750] [2022-12-13 12:58:32,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190783750] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:58:32,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2015269804] [2022-12-13 12:58:32,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:32,709 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 12:58:32,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 12:58:32,710 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 12:58:32,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-12-13 12:59:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:59:51,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-13 12:59:51,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:59:51,075 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 12:59:51,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 12:59:51,283 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-12-13 12:59:51,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-12-13 12:59:51,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:59:51,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-12-13 12:59:54,448 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:59:54,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:59:54,637 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:59:54,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:59:54,760 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:59:54,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:59:54,879 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:59:54,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 12:59:54,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-12-13 12:59:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-12-13 12:59:54,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:59:54,993 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8524) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-12-13 12:59:57,105 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8523))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8524)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 12:59:57,120 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8523))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8524)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 12:59:57,146 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8522))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8523)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8524)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 12:59:57,167 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8522))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8523)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8524)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 12:59:57,379 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8570))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8522)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8523)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8524)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 12:59:57,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2015269804] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:59:57,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:59:57,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11] total 33 [2022-12-13 12:59:57,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712731150] [2022-12-13 12:59:57,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:59:57,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 12:59:57,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:59:57,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 12:59:57,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=561, Unknown=61, NotChecked=1656, Total=2450 [2022-12-13 12:59:57,385 INFO L87 Difference]: Start difference. First operand 1248 states and 1412 transitions. Second operand has 34 states, 31 states have (on average 5.516129032258065) internal successors, (171), 34 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 13:00:15,623 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| v_arrayElimCell_113) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8007))) (exists ((v_ArrVal_8000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8000))) (exists ((v_ArrVal_7998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7998))) (exists ((v_ArrVal_8024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8024))) (exists ((v_ArrVal_8018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8018))) (exists ((v_ArrVal_8005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8005))) (exists ((v_ArrVal_8002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8002))) (exists ((v_ArrVal_7995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7995) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8022) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7993))) (exists ((v_ArrVal_8033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8033)))) is different from true [2022-12-13 13:00:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:00:18,964 INFO L93 Difference]: Finished difference Result 2307 states and 2528 transitions. [2022-12-13 13:00:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 13:00:18,964 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 5.516129032258065) internal successors, (171), 34 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 119 [2022-12-13 13:00:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:00:18,967 INFO L225 Difference]: With dead ends: 2307 [2022-12-13 13:00:18,968 INFO L226 Difference]: Without dead ends: 2307 [2022-12-13 13:00:18,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 137 SyntacticMatches, 80 SemanticMatches, 55 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=231, Invalid=850, Unknown=71, NotChecked=2040, Total=3192 [2022-12-13 13:00:18,968 INFO L413 NwaCegarLoop]: 531 mSDtfsCounter, 3319 mSDsluCounter, 5404 mSDsCounter, 0 mSdLazyCounter, 6581 mSolverCounterSat, 76 mSolverCounterUnsat, 2734 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3349 SdHoareTripleChecker+Valid, 5935 SdHoareTripleChecker+Invalid, 30749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 6581 IncrementalHoareTripleChecker+Invalid, 2734 IncrementalHoareTripleChecker+Unknown, 21358 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:00:18,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3349 Valid, 5935 Invalid, 30749 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [76 Valid, 6581 Invalid, 2734 Unknown, 21358 Unchecked, 21.1s Time] [2022-12-13 13:00:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2022-12-13 13:00:18,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 1247. [2022-12-13 13:00:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 835 states have (on average 1.6491017964071857) internal successors, (1377), 1236 states have internal predecessors, (1377), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 13:00:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1411 transitions. [2022-12-13 13:00:18,981 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1411 transitions. Word has length 119 [2022-12-13 13:00:18,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:00:18,982 INFO L495 AbstractCegarLoop]: Abstraction has 1247 states and 1411 transitions. [2022-12-13 13:00:18,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 5.516129032258065) internal successors, (171), 34 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 13:00:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1411 transitions. [2022-12-13 13:00:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-13 13:00:18,983 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:00:18,983 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] [2022-12-13 13:00:19,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2022-12-13 13:00:19,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-12-13 13:00:19,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:00:19,384 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-12-13 13:00:19,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:00:19,386 INFO L85 PathProgramCache]: Analyzing trace with hash -646855041, now seen corresponding path program 1 times [2022-12-13 13:00:19,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:00:19,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224275790] [2022-12-13 13:00:19,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:00:19,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:00:19,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:00:19,394 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:00:19,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-12-13 13:00:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:00:20,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 119 conjunts are in the unsatisfiable core [2022-12-13 13:00:20,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:00:20,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 13:00:20,893 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 13:00:20,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 13:00:20,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:00:20,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 13:00:20,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 13:00:21,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-12-13 13:00:21,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 13:00:21,094 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_ArrVal_8966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8966))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,138 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8969))) (exists ((v_ArrVal_8970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8970) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,179 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8973) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8974))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,211 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8977))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32))) (exists ((v_ArrVal_8978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8978)))) is different from true [2022-12-13 13:00:21,220 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8979))) (exists ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8980) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,231 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8982 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8982))) (exists ((v_ArrVal_8981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8981))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,241 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8984))) (exists ((v_ArrVal_8983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8983))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,251 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8985))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,261 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8988) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8987))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,271 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8990 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8990) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8989))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,282 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8992) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8991))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,292 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8994) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32))) (exists ((v_ArrVal_8993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8993) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 13:00:21,303 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8995))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32))) (exists ((v_ArrVal_8996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8996)))) is different from true [2022-12-13 13:00:21,313 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8998))) (exists ((v_ArrVal_8997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8997) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,324 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8999 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8999) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9000))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,335 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9001))) (exists ((v_ArrVal_9002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9002))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,345 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9004) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9003) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,356 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9005) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32))) (exists ((v_ArrVal_9006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9006)))) is different from true [2022-12-13 13:00:21,367 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9008 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9008) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9007))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,377 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9009) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9010 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9010) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,388 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9012) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32))) (exists ((v_ArrVal_9011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9011) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 13:00:21,399 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9014))) (exists ((v_ArrVal_9013 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9013) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,411 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9015))) (exists ((v_ArrVal_9016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9016))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,422 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9017))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32))) (exists ((v_ArrVal_9018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9018)))) is different from true [2022-12-13 13:00:21,432 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9019))) (exists ((v_ArrVal_9020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9020))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,441 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9021))) (exists ((v_ArrVal_9022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9022))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,458 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9023))) (exists ((v_ArrVal_9024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9024))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,468 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9025))) (exists ((v_ArrVal_9026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9026) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,478 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9027) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9028 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9028))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,512 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9031) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9032 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9032))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,521 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9034 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9034) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9033) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,531 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9036))) (exists ((v_ArrVal_9035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9035))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,541 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9038))) (exists ((v_ArrVal_9037 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9037) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,551 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9040) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32))) (exists ((v_ArrVal_9039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9039)))) is different from true [2022-12-13 13:00:21,560 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9041 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9041))) (exists ((v_ArrVal_9042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9042))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,570 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9043) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32))) (exists ((v_ArrVal_9044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9044)))) is different from true [2022-12-13 13:00:21,582 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9046))) (exists ((v_ArrVal_9045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9045))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,592 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9047))) (exists ((v_ArrVal_9048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9048) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,603 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9050))) (exists ((v_ArrVal_9049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9049))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,613 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9051))) (exists ((v_ArrVal_9052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9052))) (exists ((v_arrayElimCell_131 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_131) (_ bv44 32)))) is different from true [2022-12-13 13:00:21,652 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:00:21,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 13:00:21,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 13:00:21,782 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:00:21,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 13:00:21,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 13:00:21,898 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:00:21,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 13:00:21,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 13:00:21,993 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:00:21,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 13:00:21,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 13:00:22,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:00:22,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 13:00:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 980 not checked. [2022-12-13 13:00:22,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:00:22,218 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2022-12-13 13:00:22,249 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2022-12-13 13:00:22,354 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9056) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9055) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9055))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9056) .cse2 v_ArrVal_9058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-13 13:00:22,398 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9055))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9056) .cse1 v_ArrVal_9058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9056) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9055) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2022-12-13 13:00:30,331 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9053))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9055))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9054) .cse1 v_ArrVal_9056) .cse2 v_ArrVal_9058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9053))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9054) .cse7 v_ArrVal_9056) (select (select (store .cse8 .cse7 v_ArrVal_9055) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9058))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2022-12-13 13:00:33,982 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9149))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9053))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9055))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9150) .cse0 v_ArrVal_9054) .cse1 v_ArrVal_9056) .cse2 v_ArrVal_9058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9149))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9053))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9150) .cse8 v_ArrVal_9054) .cse9 v_ArrVal_9056) (select (select (store .cse10 .cse9 v_ArrVal_9055) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9058))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2022-12-13 13:00:34,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:00:34,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224275790] [2022-12-13 13:00:34,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224275790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:00:34,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1753753210] [2022-12-13 13:00:34,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:00:34,021 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 13:00:34,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 13:00:34,022 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 13:00:34,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bea8bd-faba-4fe8-a1e3-19b0ba9acf62/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process