./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 14:13:58,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:13:58,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:13:58,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:13:58,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:13:58,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:13:58,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:13:58,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:13:58,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:13:58,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:13:58,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:13:58,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:13:58,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:13:58,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:13:58,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:13:58,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:13:58,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:13:58,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:13:58,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:13:58,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:13:58,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:13:58,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:13:58,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:13:58,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:13:58,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:13:58,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:13:58,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:13:58,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:13:58,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:13:58,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:13:58,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:13:58,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:13:58,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:13:58,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:13:58,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:13:58,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:13:58,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:13:58,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:13:58,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:13:58,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:13:58,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:13:58,849 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 14:13:58,888 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:13:58,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:13:58,889 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:13:58,889 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:13:58,890 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:13:58,890 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:13:58,891 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:13:58,891 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:13:58,891 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:13:58,892 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:13:58,893 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:13:58,893 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:13:58,893 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:13:58,894 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:13:58,894 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:13:58,894 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:13:58,894 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:13:58,895 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:13:58,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 14:13:58,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 14:13:58,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:13:58,896 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:13:58,897 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:13:58,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:13:58,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:13:58,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:13:58,898 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 14:13:58,898 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 14:13:58,899 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 14:13:58,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:13:58,899 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:13:58,900 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:13:58,900 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:13:58,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:13:58,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:13:58,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:13:58,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:13:58,901 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:13:58,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:13:58,902 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:13:58,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:13:58,903 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:13:58,903 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 [2022-11-23 14:13:59,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:13:59,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:13:59,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:13:59,186 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:13:59,186 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:13:59,187 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2022-11-23 14:14:02,274 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:14:02,618 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:14:02,619 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2022-11-23 14:14:02,639 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/data/6d65cf964/a32fc7521b414bcb9c9d358c050de7a8/FLAG5f6836a09 [2022-11-23 14:14:02,656 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/data/6d65cf964/a32fc7521b414bcb9c9d358c050de7a8 [2022-11-23 14:14:02,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:14:02,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:14:02,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:14:02,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:14:02,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:14:02,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:02" (1/1) ... [2022-11-23 14:14:02,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae2a796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:02, skipping insertion in model container [2022-11-23 14:14:02,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:02" (1/1) ... [2022-11-23 14:14:02,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:14:02,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:14:03,401 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2022-11-23 14:14:03,416 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2022-11-23 14:14:03,528 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2022-11-23 14:14:03,530 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2022-11-23 14:14:03,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:14:03,547 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-23 14:14:03,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@392747d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:03, skipping insertion in model container [2022-11-23 14:14:03,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:14:03,548 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-23 14:14:03,550 INFO L158 Benchmark]: Toolchain (without parser) took 888.16ms. Allocated memory is still 203.4MB. Free memory was 155.6MB in the beginning and 133.9MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 14:14:03,550 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:14:03,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 883.68ms. Allocated memory is still 203.4MB. Free memory was 155.6MB in the beginning and 133.9MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 14:14:03,552 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.21ms. Allocated memory is still 155.2MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 883.68ms. Allocated memory is still 203.4MB. Free memory was 155.6MB in the beginning and 133.9MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 14:14:05,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:14:05,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:14:05,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:14:05,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:14:05,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:14:05,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:14:05,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:14:05,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:14:05,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:14:05,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:14:05,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:14:05,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:14:05,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:14:05,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:14:05,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:14:05,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:14:05,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:14:05,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:14:05,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:14:05,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:14:05,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:14:05,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:14:05,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:14:05,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:14:05,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:14:05,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:14:05,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:14:05,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:14:05,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:14:05,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:14:05,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:14:05,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:14:05,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:14:05,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:14:05,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:14:05,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:14:05,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:14:05,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:14:05,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:14:05,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:14:05,839 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-23 14:14:05,886 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:14:05,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:14:05,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:14:05,888 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:14:05,889 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:14:05,889 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:14:05,889 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:14:05,889 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:14:05,889 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:14:05,890 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:14:05,891 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:14:05,891 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:14:05,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 14:14:05,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 14:14:05,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:14:05,893 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:14:05,893 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:14:05,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:14:05,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:14:05,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:14:05,894 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 14:14:05,894 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 14:14:05,894 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 14:14:05,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:14:05,895 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:14:05,895 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 14:14:05,895 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 14:14:05,895 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:14:05,895 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:14:05,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:14:05,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 14:14:05,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:14:05,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:14:05,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:14:05,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:14:05,898 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 14:14:05,898 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 14:14:05,898 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:14:05,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 14:14:05,899 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 [2022-11-23 14:14:06,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:14:06,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:14:06,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:14:06,304 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:14:06,305 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:14:06,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2022-11-23 14:14:09,372 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:14:09,756 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:14:09,757 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2022-11-23 14:14:09,773 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/data/97ba56a9c/84d76ff387674bc2ae5aa7168d4cc89d/FLAG966afb3e6 [2022-11-23 14:14:09,792 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/data/97ba56a9c/84d76ff387674bc2ae5aa7168d4cc89d [2022-11-23 14:14:09,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:14:09,796 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:14:09,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:14:09,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:14:09,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:14:09,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:09" (1/1) ... [2022-11-23 14:14:09,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@298b6580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:09, skipping insertion in model container [2022-11-23 14:14:09,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:09" (1/1) ... [2022-11-23 14:14:09,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:14:09,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:14:10,563 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2022-11-23 14:14:10,589 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2022-11-23 14:14:10,743 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2022-11-23 14:14:10,752 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2022-11-23 14:14:10,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:14:10,793 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-23 14:14:10,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:14:10,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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2022-11-23 14:14:10,862 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2022-11-23 14:14:10,937 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2022-11-23 14:14:10,938 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2022-11-23 14:14:10,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:14:10,950 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:14:10,996 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2022-11-23 14:14:10,998 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2022-11-23 14:14:11,037 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2022-11-23 14:14:11,038 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_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2022-11-23 14:14:11,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:14:11,112 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:14:11,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:11 WrapperNode [2022-11-23 14:14:11,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:14:11,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:14:11,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:14:11,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:14:11,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:11" (1/1) ... [2022-11-23 14:14:11,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:11" (1/1) ... [2022-11-23 14:14:11,211 INFO L138 Inliner]: procedures = 285, calls = 294, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1038 [2022-11-23 14:14:11,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:14:11,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:14:11,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:14:11,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:14:11,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:11" (1/1) ... [2022-11-23 14:14:11,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:11" (1/1) ... [2022-11-23 14:14:11,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:11" (1/1) ... [2022-11-23 14:14:11,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:11" (1/1) ... [2022-11-23 14:14:11,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:11" (1/1) ... [2022-11-23 14:14:11,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:11" (1/1) ... [2022-11-23 14:14:11,317 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:11" (1/1) ... [2022-11-23 14:14:11,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:11" (1/1) ... [2022-11-23 14:14:11,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:14:11,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:14:11,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:14:11,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:14:11,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:11" (1/1) ... [2022-11-23 14:14:11,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:14:11,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:14:11,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:14:11,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:14:11,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-23 14:14:11,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 14:14:11,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 14:14:11,460 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-23 14:14:11,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 14:14:11,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:14:11,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 14:14:11,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 14:14:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2022-11-23 14:14:11,462 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2022-11-23 14:14:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 14:14:11,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 14:14:11,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 14:14:11,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:14:11,464 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2022-11-23 14:14:11,465 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2022-11-23 14:14:11,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 14:14:11,466 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2022-11-23 14:14:11,466 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2022-11-23 14:14:11,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:14:11,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:14:11,809 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:14:11,811 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:14:16,866 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:14:16,888 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:14:16,889 INFO L300 CfgBuilder]: Removed 63 assume(true) statements. [2022-11-23 14:14:16,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:14:16 BoogieIcfgContainer [2022-11-23 14:14:16,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:14:16,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:14:16,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:14:16,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:14:16,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:14:09" (1/3) ... [2022-11-23 14:14:16,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdfa7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:14:16, skipping insertion in model container [2022-11-23 14:14:16,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:11" (2/3) ... [2022-11-23 14:14:16,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdfa7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:14:16, skipping insertion in model container [2022-11-23 14:14:16,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:14:16" (3/3) ... [2022-11-23 14:14:16,904 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-1.i [2022-11-23 14:14:16,923 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:14:16,923 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 531 error locations. [2022-11-23 14:14:16,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:14:17,006 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c4c0b40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:14:17,007 INFO L358 AbstractCegarLoop]: Starting to check reachability of 531 error locations. [2022-11-23 14:14:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 1082 states, 533 states have (on average 2.2288930581613506) internal successors, (1188), 1064 states have internal predecessors, (1188), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-23 14:14:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:14:17,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:17,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:14:17,026 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:14:17,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:17,034 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2022-11-23 14:14:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:14:17,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264500753] [2022-11-23 14:14:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:17,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:17,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:14:17,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:14:17,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-23 14:14:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:17,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:14:17,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:17,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:14:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:14:17,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:14:17,314 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:14:17,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264500753] [2022-11-23 14:14:17,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264500753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:14:17,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:14:17,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:14:17,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512993655] [2022-11-23 14:14:17,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:14:17,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:14:17,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:14:17,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:14:17,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:14:17,352 INFO L87 Difference]: Start difference. First operand has 1082 states, 533 states have (on average 2.2288930581613506) internal successors, (1188), 1064 states have internal predecessors, (1188), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:14:19,773 INFO L93 Difference]: Finished difference Result 1161 states and 1227 transitions. [2022-11-23 14:14:19,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:14:19,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 14:14:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:14:19,805 INFO L225 Difference]: With dead ends: 1161 [2022-11-23 14:14:19,805 INFO L226 Difference]: Without dead ends: 1159 [2022-11-23 14:14:19,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:14:19,813 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 714 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:14:19,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1040 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-23 14:14:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-11-23 14:14:20,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1102. [2022-11-23 14:14:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 567 states have (on average 2.0846560846560847) internal successors, (1182), 1085 states have internal predecessors, (1182), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-23 14:14:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1208 transitions. [2022-11-23 14:14:20,042 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1208 transitions. Word has length 3 [2022-11-23 14:14:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:14:20,042 INFO L495 AbstractCegarLoop]: Abstraction has 1102 states and 1208 transitions. [2022-11-23 14:14:20,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1208 transitions. [2022-11-23 14:14:20,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:14:20,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:20,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:14:20,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-23 14:14:20,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:20,253 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:14:20,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:20,254 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2022-11-23 14:14:20,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:14:20,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782258794] [2022-11-23 14:14:20,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:20,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:20,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:14:20,256 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:14:20,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-23 14:14:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:20,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:14:20,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:20,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:14:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:14:20,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:14:20,416 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:14:20,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782258794] [2022-11-23 14:14:20,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782258794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:14:20,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:14:20,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:14:20,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137420886] [2022-11-23 14:14:20,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:14:20,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:14:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:14:20,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:14:20,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:14:20,419 INFO L87 Difference]: Start difference. First operand 1102 states and 1208 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:14:23,853 INFO L93 Difference]: Finished difference Result 1496 states and 1636 transitions. [2022-11-23 14:14:23,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:14:23,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 14:14:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:14:23,860 INFO L225 Difference]: With dead ends: 1496 [2022-11-23 14:14:23,860 INFO L226 Difference]: Without dead ends: 1496 [2022-11-23 14:14:23,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:14:23,862 INFO L413 NwaCegarLoop]: 941 mSDtfsCounter, 418 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:14:23,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1534 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-23 14:14:23,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2022-11-23 14:14:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1306. [2022-11-23 14:14:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 770 states have (on average 2.07012987012987) internal successors, (1594), 1287 states have internal predecessors, (1594), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-23 14:14:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1624 transitions. [2022-11-23 14:14:23,896 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1624 transitions. Word has length 3 [2022-11-23 14:14:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:14:23,897 INFO L495 AbstractCegarLoop]: Abstraction has 1306 states and 1624 transitions. [2022-11-23 14:14:23,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1624 transitions. [2022-11-23 14:14:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 14:14:23,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:23,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:14:23,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:14:24,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:24,109 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:14:24,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:24,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2022-11-23 14:14:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:14:24,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260602731] [2022-11-23 14:14:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:24,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:24,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:14:24,112 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:14:24,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-23 14:14:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:24,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 14:14:24,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:24,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:14:24,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:14:24,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:24,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 14:14:24,440 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:14:24,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:14:24,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-11-23 14:14:24,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:14:24,479 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:14:24,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260602731] [2022-11-23 14:14:24,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260602731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:14:24,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:14:24,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:14:24,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667138135] [2022-11-23 14:14:24,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:14:24,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:14:24,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:14:24,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:14:24,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:14:24,482 INFO L87 Difference]: Start difference. First operand 1306 states and 1624 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:14:30,276 INFO L93 Difference]: Finished difference Result 1996 states and 2369 transitions. [2022-11-23 14:14:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:14:30,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-23 14:14:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:14:30,292 INFO L225 Difference]: With dead ends: 1996 [2022-11-23 14:14:30,292 INFO L226 Difference]: Without dead ends: 1996 [2022-11-23 14:14:30,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:14:30,302 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 720 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-23 14:14:30,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1581 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-23 14:14:30,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2022-11-23 14:14:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1451. [2022-11-23 14:14:30,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 915 states have (on average 2.0513661202185793) internal successors, (1877), 1432 states have internal predecessors, (1877), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-23 14:14:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1907 transitions. [2022-11-23 14:14:30,338 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1907 transitions. Word has length 8 [2022-11-23 14:14:30,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:14:30,339 INFO L495 AbstractCegarLoop]: Abstraction has 1451 states and 1907 transitions. [2022-11-23 14:14:30,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1907 transitions. [2022-11-23 14:14:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 14:14:30,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:30,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:14:30,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:14:30,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:30,552 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:14:30,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:30,552 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2022-11-23 14:14:30,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:14:30,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630100457] [2022-11-23 14:14:30,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:30,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:30,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:14:30,554 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:14:30,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-23 14:14:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:30,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:14:30,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:30,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:14:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:14:30,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:14:30,724 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:14:30,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630100457] [2022-11-23 14:14:30,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630100457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:14:30,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:14:30,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:14:30,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784337292] [2022-11-23 14:14:30,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:14:30,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:14:30,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:14:30,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:14:30,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:14:30,736 INFO L87 Difference]: Start difference. First operand 1451 states and 1907 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:14:34,367 INFO L93 Difference]: Finished difference Result 2429 states and 3105 transitions. [2022-11-23 14:14:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:14:34,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-11-23 14:14:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:14:34,376 INFO L225 Difference]: With dead ends: 2429 [2022-11-23 14:14:34,376 INFO L226 Difference]: Without dead ends: 2429 [2022-11-23 14:14:34,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:14:34,377 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 2139 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:14:34,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 1969 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-23 14:14:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2022-11-23 14:14:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 1406. [2022-11-23 14:14:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 915 states have (on average 1.9868852459016393) internal successors, (1818), 1387 states have internal predecessors, (1818), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-23 14:14:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1848 transitions. [2022-11-23 14:14:34,414 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1848 transitions. Word has length 9 [2022-11-23 14:14:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:14:34,415 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 1848 transitions. [2022-11-23 14:14:34,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1848 transitions. [2022-11-23 14:14:34,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 14:14:34,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:34,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:14:34,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-23 14:14:34,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:34,627 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:14:34,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:34,627 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2022-11-23 14:14:34,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:14:34,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421461090] [2022-11-23 14:14:34,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:34,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:34,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:14:34,629 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:14:34,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-23 14:14:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:34,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 14:14:34,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:34,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:14:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:14:34,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:14:34,846 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:14:34,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421461090] [2022-11-23 14:14:34,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421461090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:14:34,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:14:34,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:14:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856324327] [2022-11-23 14:14:34,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:14:34,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:14:34,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:14:34,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:14:34,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:14:34,848 INFO L87 Difference]: Start difference. First operand 1406 states and 1848 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:14:39,085 INFO L93 Difference]: Finished difference Result 2045 states and 2683 transitions. [2022-11-23 14:14:39,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:14:39,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-11-23 14:14:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:14:39,092 INFO L225 Difference]: With dead ends: 2045 [2022-11-23 14:14:39,092 INFO L226 Difference]: Without dead ends: 2045 [2022-11-23 14:14:39,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:14:39,094 INFO L413 NwaCegarLoop]: 1191 mSDtfsCounter, 1375 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:14:39,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 2090 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-23 14:14:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2022-11-23 14:14:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1396. [2022-11-23 14:14:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 915 states have (on average 1.960655737704918) internal successors, (1794), 1377 states have internal predecessors, (1794), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-23 14:14:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1824 transitions. [2022-11-23 14:14:39,126 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1824 transitions. Word has length 9 [2022-11-23 14:14:39,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:14:39,126 INFO L495 AbstractCegarLoop]: Abstraction has 1396 states and 1824 transitions. [2022-11-23 14:14:39,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1824 transitions. [2022-11-23 14:14:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:14:39,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:39,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:14:39,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-23 14:14:39,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:39,339 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr516ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:14:39,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:39,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1033799265, now seen corresponding path program 1 times [2022-11-23 14:14:39,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:14:39,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463222369] [2022-11-23 14:14:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:39,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:39,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:14:39,341 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:14:39,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-23 14:14:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:39,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:14:39,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:14:39,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:14:39,582 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:14:39,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463222369] [2022-11-23 14:14:39,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463222369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:14:39,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:14:39,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:14:39,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552792642] [2022-11-23 14:14:39,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:14:39,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:14:39,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:14:39,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:14:39,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:14:39,584 INFO L87 Difference]: Start difference. First operand 1396 states and 1824 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:14:40,365 INFO L93 Difference]: Finished difference Result 1872 states and 2391 transitions. [2022-11-23 14:14:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:14:40,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-23 14:14:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:14:40,372 INFO L225 Difference]: With dead ends: 1872 [2022-11-23 14:14:40,372 INFO L226 Difference]: Without dead ends: 1872 [2022-11-23 14:14:40,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:14:40,373 INFO L413 NwaCegarLoop]: 1154 mSDtfsCounter, 546 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 3116 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 14:14:40,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 3116 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 14:14:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2022-11-23 14:14:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1647. [2022-11-23 14:14:40,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1166 states have (on average 1.9742710120068612) internal successors, (2302), 1628 states have internal predecessors, (2302), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-23 14:14:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2332 transitions. [2022-11-23 14:14:40,431 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2332 transitions. Word has length 11 [2022-11-23 14:14:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:14:40,431 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 2332 transitions. [2022-11-23 14:14:40,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:40,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2332 transitions. [2022-11-23 14:14:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 14:14:40,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:40,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:14:40,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-23 14:14:40,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:40,644 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:14:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:40,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1297880888, now seen corresponding path program 1 times [2022-11-23 14:14:40,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:14:40,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268861722] [2022-11-23 14:14:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:40,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:40,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:14:40,648 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:14:40,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-23 14:14:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:40,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 14:14:40,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:40,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:14:40,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:14:40,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:14:40,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-11-23 14:14:40,931 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:14:40,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-11-23 14:14:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:14:40,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:14:40,950 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:14:40,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268861722] [2022-11-23 14:14:40,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268861722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:14:40,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:14:40,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:14:40,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818941647] [2022-11-23 14:14:40,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:14:40,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:14:40,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:14:40,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:14:40,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:14:40,952 INFO L87 Difference]: Start difference. First operand 1647 states and 2332 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:14:42,694 INFO L93 Difference]: Finished difference Result 1653 states and 2035 transitions. [2022-11-23 14:14:42,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:14:42,695 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 14:14:42,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:14:42,699 INFO L225 Difference]: With dead ends: 1653 [2022-11-23 14:14:42,699 INFO L226 Difference]: Without dead ends: 1653 [2022-11-23 14:14:42,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:14:42,700 INFO L413 NwaCegarLoop]: 1038 mSDtfsCounter, 358 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-23 14:14:42,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 2971 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-23 14:14:42,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-11-23 14:14:42,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1289. [2022-11-23 14:14:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 810 states have (on average 1.9506172839506173) internal successors, (1580), 1272 states have internal predecessors, (1580), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-23 14:14:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1606 transitions. [2022-11-23 14:14:42,727 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1606 transitions. Word has length 14 [2022-11-23 14:14:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:14:42,727 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1606 transitions. [2022-11-23 14:14:42,727 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1606 transitions. [2022-11-23 14:14:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 14:14:42,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:42,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:14:42,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-23 14:14:42,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:42,940 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:14:42,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:42,941 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2022-11-23 14:14:42,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:14:42,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755903841] [2022-11-23 14:14:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:42,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:42,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:14:42,943 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:14:42,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-23 14:14:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:43,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 14:14:43,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:14:43,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:14:43,178 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:14:43,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755903841] [2022-11-23 14:14:43,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755903841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:14:43,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:14:43,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:14:43,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623003250] [2022-11-23 14:14:43,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:14:43,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:14:43,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:14:43,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:14:43,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:14:43,181 INFO L87 Difference]: Start difference. First operand 1289 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:14:43,212 INFO L93 Difference]: Finished difference Result 1229 states and 1520 transitions. [2022-11-23 14:14:43,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:14:43,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-11-23 14:14:43,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:14:43,217 INFO L225 Difference]: With dead ends: 1229 [2022-11-23 14:14:43,217 INFO L226 Difference]: Without dead ends: 1229 [2022-11-23 14:14:43,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:14:43,218 INFO L413 NwaCegarLoop]: 1027 mSDtfsCounter, 957 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:14:43,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 1094 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:14:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2022-11-23 14:14:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1229. [2022-11-23 14:14:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 774 states have (on average 1.930232558139535) internal successors, (1494), 1212 states have internal predecessors, (1494), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-23 14:14:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1520 transitions. [2022-11-23 14:14:43,246 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1520 transitions. Word has length 19 [2022-11-23 14:14:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:14:43,247 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 1520 transitions. [2022-11-23 14:14:43,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1520 transitions. [2022-11-23 14:14:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 14:14:43,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:43,248 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] [2022-11-23 14:14:43,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-23 14:14:43,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:43,461 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:14:43,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2022-11-23 14:14:43,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:14:43,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467863221] [2022-11-23 14:14:43,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:43,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:43,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:14:43,463 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:14:43,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-23 14:14:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:43,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:14:43,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:14:43,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:14:43,682 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:14:43,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467863221] [2022-11-23 14:14:43,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467863221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:14:43,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:14:43,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:14:43,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933283184] [2022-11-23 14:14:43,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:14:43,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:14:43,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:14:43,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:14:43,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:14:43,685 INFO L87 Difference]: Start difference. First operand 1229 states and 1520 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:14:43,767 INFO L93 Difference]: Finished difference Result 1201 states and 1464 transitions. [2022-11-23 14:14:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:14:43,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2022-11-23 14:14:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:14:43,772 INFO L225 Difference]: With dead ends: 1201 [2022-11-23 14:14:43,772 INFO L226 Difference]: Without dead ends: 1201 [2022-11-23 14:14:43,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:14:43,775 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 938 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:14:43,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 2024 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:14:43,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-11-23 14:14:43,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1199. [2022-11-23 14:14:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 758 states have (on average 1.8944591029023747) internal successors, (1436), 1182 states have internal predecessors, (1436), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-23 14:14:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1462 transitions. [2022-11-23 14:14:43,800 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1462 transitions. Word has length 21 [2022-11-23 14:14:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:14:43,801 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1462 transitions. [2022-11-23 14:14:43,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1462 transitions. [2022-11-23 14:14:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-23 14:14:43,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:43,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] [2022-11-23 14:14:43,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-23 14:14:44,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:44,014 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:14:44,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:44,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2022-11-23 14:14:44,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:14:44,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464567764] [2022-11-23 14:14:44,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:44,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:44,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:14:44,020 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:14:44,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-23 14:14:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:44,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:14:44,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:44,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:14:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:14:44,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:14:44,347 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:14:44,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464567764] [2022-11-23 14:14:44,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464567764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:14:44,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:14:44,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:14:44,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700715719] [2022-11-23 14:14:44,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:14:44,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:14:44,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:14:44,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:14:44,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:14:44,349 INFO L87 Difference]: Start difference. First operand 1199 states and 1462 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:14:48,489 INFO L93 Difference]: Finished difference Result 2183 states and 2663 transitions. [2022-11-23 14:14:48,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:14:48,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2022-11-23 14:14:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:14:48,497 INFO L225 Difference]: With dead ends: 2183 [2022-11-23 14:14:48,497 INFO L226 Difference]: Without dead ends: 2183 [2022-11-23 14:14:48,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:14:48,498 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 2036 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:14:48,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2039 Valid, 2017 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-23 14:14:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2022-11-23 14:14:48,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1195. [2022-11-23 14:14:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 758 states have (on average 1.883905013192612) internal successors, (1428), 1178 states have internal predecessors, (1428), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-23 14:14:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1454 transitions. [2022-11-23 14:14:48,522 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1454 transitions. Word has length 35 [2022-11-23 14:14:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:14:48,523 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1454 transitions. [2022-11-23 14:14:48,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1454 transitions. [2022-11-23 14:14:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-23 14:14:48,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:48,524 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] [2022-11-23 14:14:48,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-23 14:14:48,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:48,737 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:14:48,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:48,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2022-11-23 14:14:48,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:14:48,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551895223] [2022-11-23 14:14:48,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:48,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:48,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:14:48,740 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:14:48,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-23 14:14:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:48,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 14:14:48,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:48,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:14:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:14:49,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:14:49,209 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:14:49,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551895223] [2022-11-23 14:14:49,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551895223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:14:49,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:14:49,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:14:49,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324334439] [2022-11-23 14:14:49,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:14:49,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:14:49,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:14:49,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:14:49,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:14:49,211 INFO L87 Difference]: Start difference. First operand 1195 states and 1454 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:14:54,045 INFO L93 Difference]: Finished difference Result 1805 states and 2217 transitions. [2022-11-23 14:14:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:14:54,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2022-11-23 14:14:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:14:54,052 INFO L225 Difference]: With dead ends: 1805 [2022-11-23 14:14:54,052 INFO L226 Difference]: Without dead ends: 1805 [2022-11-23 14:14:54,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:14:54,053 INFO L413 NwaCegarLoop]: 1229 mSDtfsCounter, 1783 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-23 14:14:54,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 2579 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-23 14:14:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-11-23 14:14:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1191. [2022-11-23 14:14:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 758 states have (on average 1.8733509234828496) internal successors, (1420), 1174 states have internal predecessors, (1420), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-23 14:14:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1446 transitions. [2022-11-23 14:14:54,074 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1446 transitions. Word has length 35 [2022-11-23 14:14:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:14:54,075 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1446 transitions. [2022-11-23 14:14:54,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1446 transitions. [2022-11-23 14:14:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-23 14:14:54,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:54,076 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] [2022-11-23 14:14:54,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-23 14:14:54,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:54,289 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:14:54,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:54,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2063932984, now seen corresponding path program 1 times [2022-11-23 14:14:54,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:14:54,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46455908] [2022-11-23 14:14:54,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:54,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:54,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:14:54,291 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:14:54,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-23 14:14:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:54,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:14:54,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:54,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:14:54,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:14:54,621 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:14:54,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46455908] [2022-11-23 14:14:54,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46455908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:14:54,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:14:54,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:14:54,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864014293] [2022-11-23 14:14:54,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:14:54,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:14:54,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:14:54,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:14:54,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:14:54,623 INFO L87 Difference]: Start difference. First operand 1191 states and 1446 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:14:54,689 INFO L93 Difference]: Finished difference Result 1179 states and 1426 transitions. [2022-11-23 14:14:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:14:54,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-11-23 14:14:54,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:14:54,694 INFO L225 Difference]: With dead ends: 1179 [2022-11-23 14:14:54,694 INFO L226 Difference]: Without dead ends: 1179 [2022-11-23 14:14:54,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:14:54,695 INFO L413 NwaCegarLoop]: 976 mSDtfsCounter, 907 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:14:54,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 2002 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:14:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-11-23 14:14:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2022-11-23 14:14:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 746 states have (on average 1.876675603217158) internal successors, (1400), 1162 states have internal predecessors, (1400), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-23 14:14:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1426 transitions. [2022-11-23 14:14:54,716 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1426 transitions. Word has length 54 [2022-11-23 14:14:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:14:54,716 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1426 transitions. [2022-11-23 14:14:54,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:14:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1426 transitions. [2022-11-23 14:14:54,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 14:14:54,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:54,720 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] [2022-11-23 14:14:54,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-23 14:14:54,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:54,933 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:14:54,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:54,933 INFO L85 PathProgramCache]: Analyzing trace with hash -203146628, now seen corresponding path program 1 times [2022-11-23 14:14:54,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:14:54,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396202106] [2022-11-23 14:14:54,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:54,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:14:54,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:14:54,935 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:14:54,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-23 14:14:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:55,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 14:14:55,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:55,354 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 14:14:55,355 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 24 [2022-11-23 14:14:55,423 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 14:14:55,424 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 18 treesize of output 28 [2022-11-23 14:14:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:14:55,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:14:55,872 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:14:55,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396202106] [2022-11-23 14:14:55,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396202106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:14:55,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:14:55,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:14:55,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469614256] [2022-11-23 14:14:55,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:14:55,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:14:55,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:14:55,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:14:55,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:14:55,874 INFO L87 Difference]: Start difference. First operand 1179 states and 1426 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:15:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:15:00,017 INFO L93 Difference]: Finished difference Result 2639 states and 3164 transitions. [2022-11-23 14:15:00,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:15:00,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-23 14:15:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:15:00,025 INFO L225 Difference]: With dead ends: 2639 [2022-11-23 14:15:00,025 INFO L226 Difference]: Without dead ends: 2639 [2022-11-23 14:15:00,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:15:00,026 INFO L413 NwaCegarLoop]: 881 mSDtfsCounter, 3133 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3133 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:15:00,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3133 Valid, 1820 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-23 14:15:00,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2022-11-23 14:15:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 1615. [2022-11-23 14:15:00,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1167 states have (on average 1.8723221936589547) internal successors, (2185), 1586 states have internal predecessors, (2185), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 14:15:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2235 transitions. [2022-11-23 14:15:00,058 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2235 transitions. Word has length 62 [2022-11-23 14:15:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:15:00,059 INFO L495 AbstractCegarLoop]: Abstraction has 1615 states and 2235 transitions. [2022-11-23 14:15:00,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:15:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2235 transitions. [2022-11-23 14:15:00,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 14:15:00,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:15:00,060 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] [2022-11-23 14:15:00,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-11-23 14:15:00,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:00,275 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:15:00,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:15:00,276 INFO L85 PathProgramCache]: Analyzing trace with hash -203146627, now seen corresponding path program 1 times [2022-11-23 14:15:00,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:15:00,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179122705] [2022-11-23 14:15:00,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:15:00,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:00,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:15:00,278 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:15:00,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-23 14:15:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:15:00,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 14:15:00,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:15:00,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:00,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 14:15:00,897 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:15:00,897 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 14 [2022-11-23 14:15:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:01,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:15:01,647 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:15:01,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179122705] [2022-11-23 14:15:01,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179122705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:15:01,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:15:01,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:15:01,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560002738] [2022-11-23 14:15:01,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:15:01,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:15:01,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:15:01,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:15:01,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:15:01,649 INFO L87 Difference]: Start difference. First operand 1615 states and 2235 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:15:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:15:06,108 INFO L93 Difference]: Finished difference Result 1621 states and 2242 transitions. [2022-11-23 14:15:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:15:06,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-23 14:15:06,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:15:06,115 INFO L225 Difference]: With dead ends: 1621 [2022-11-23 14:15:06,115 INFO L226 Difference]: Without dead ends: 1621 [2022-11-23 14:15:06,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:15:06,116 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 111 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:15:06,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 2283 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-23 14:15:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-11-23 14:15:06,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1620. [2022-11-23 14:15:06,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1171 states have (on average 1.8693424423569598) internal successors, (2189), 1590 states have internal predecessors, (2189), 26 states have call successors, (26), 9 states have call predecessors, (26), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-23 14:15:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2241 transitions. [2022-11-23 14:15:06,143 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2241 transitions. Word has length 62 [2022-11-23 14:15:06,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:15:06,143 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 2241 transitions. [2022-11-23 14:15:06,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:15:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2241 transitions. [2022-11-23 14:15:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-23 14:15:06,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:15:06,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:15:06,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-23 14:15:06,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:06,360 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:15:06,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:15:06,360 INFO L85 PathProgramCache]: Analyzing trace with hash 389814229, now seen corresponding path program 1 times [2022-11-23 14:15:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:15:06,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138811670] [2022-11-23 14:15:06,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:15:06,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:06,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:15:06,363 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:15:06,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-23 14:15:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:15:06,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:15:06,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:15:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:06,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:15:06,782 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:15:06,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138811670] [2022-11-23 14:15:06,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138811670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:15:06,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:15:06,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 14:15:06,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688999964] [2022-11-23 14:15:06,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:15:06,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:15:06,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:15:06,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:15:06,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:15:06,784 INFO L87 Difference]: Start difference. First operand 1620 states and 2241 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:15:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:15:06,910 INFO L93 Difference]: Finished difference Result 1646 states and 2268 transitions. [2022-11-23 14:15:06,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:15:06,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-23 14:15:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:15:06,916 INFO L225 Difference]: With dead ends: 1646 [2022-11-23 14:15:06,916 INFO L226 Difference]: Without dead ends: 1646 [2022-11-23 14:15:06,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:15:06,917 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 19 mSDsluCounter, 3882 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4855 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:15:06,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4855 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:15:06,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-11-23 14:15:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1644. [2022-11-23 14:15:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1189 states have (on average 1.8603868797308662) internal successors, (2212), 1610 states have internal predecessors, (2212), 28 states have call successors, (28), 13 states have call predecessors, (28), 11 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-23 14:15:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2268 transitions. [2022-11-23 14:15:06,949 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2268 transitions. Word has length 68 [2022-11-23 14:15:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:15:06,950 INFO L495 AbstractCegarLoop]: Abstraction has 1644 states and 2268 transitions. [2022-11-23 14:15:06,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:15:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2268 transitions. [2022-11-23 14:15:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-23 14:15:06,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:15:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:15:06,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-23 14:15:07,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:07,165 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:15:07,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:15:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash 341176989, now seen corresponding path program 1 times [2022-11-23 14:15:07,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:15:07,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89998963] [2022-11-23 14:15:07,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:15:07,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:07,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:15:07,168 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:15:07,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-23 14:15:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:15:07,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:15:07,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:15:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:07,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:15:07,709 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:15:07,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89998963] [2022-11-23 14:15:07,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89998963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:15:07,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:15:07,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:15:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111595111] [2022-11-23 14:15:07,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:15:07,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:15:07,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:15:07,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:15:07,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:15:07,711 INFO L87 Difference]: Start difference. First operand 1644 states and 2268 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:15:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:15:07,942 INFO L93 Difference]: Finished difference Result 1656 states and 2282 transitions. [2022-11-23 14:15:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:15:07,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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 68 [2022-11-23 14:15:07,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:15:07,954 INFO L225 Difference]: With dead ends: 1656 [2022-11-23 14:15:07,954 INFO L226 Difference]: Without dead ends: 1656 [2022-11-23 14:15:07,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:15:07,955 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 23 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3777 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:15:07,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3777 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:15:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-11-23 14:15:07,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1647. [2022-11-23 14:15:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1191 states have (on average 1.858942065491184) internal successors, (2214), 1612 states have internal predecessors, (2214), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-23 14:15:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2271 transitions. [2022-11-23 14:15:07,992 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2271 transitions. Word has length 68 [2022-11-23 14:15:07,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:15:07,993 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 2271 transitions. [2022-11-23 14:15:07,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:15:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2271 transitions. [2022-11-23 14:15:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-23 14:15:07,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:15:07,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:15:08,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-23 14:15:08,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:08,209 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:15:08,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:15:08,210 INFO L85 PathProgramCache]: Analyzing trace with hash -233122725, now seen corresponding path program 1 times [2022-11-23 14:15:08,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:15:08,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757753280] [2022-11-23 14:15:08,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:15:08,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:08,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:15:08,211 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:15:08,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-23 14:15:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:15:08,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 14:15:08,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:15:08,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:15:08,815 WARN L859 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)))) is different from true [2022-11-23 14:15:08,847 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:15:08,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-23 14:15:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:08,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:15:08,861 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:15:08,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757753280] [2022-11-23 14:15:08,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757753280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:15:08,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:15:08,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:15:08,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919320394] [2022-11-23 14:15:08,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:15:08,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:15:08,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:15:08,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:15:08,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2022-11-23 14:15:08,863 INFO L87 Difference]: Start difference. First operand 1647 states and 2271 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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-11-23 14:15:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:15:13,415 INFO L93 Difference]: Finished difference Result 2769 states and 3749 transitions. [2022-11-23 14:15:13,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:15:13,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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 73 [2022-11-23 14:15:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:15:13,423 INFO L225 Difference]: With dead ends: 2769 [2022-11-23 14:15:13,423 INFO L226 Difference]: Without dead ends: 2769 [2022-11-23 14:15:13,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2022-11-23 14:15:13,424 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 1428 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 4034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1894 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:15:13,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 2219 Invalid, 4034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2121 Invalid, 0 Unknown, 1894 Unchecked, 4.4s Time] [2022-11-23 14:15:13,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2022-11-23 14:15:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1646. [2022-11-23 14:15:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1191 states have (on average 1.8572628043660788) internal successors, (2212), 1611 states have internal predecessors, (2212), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-23 14:15:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2269 transitions. [2022-11-23 14:15:13,455 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2269 transitions. Word has length 73 [2022-11-23 14:15:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:15:13,456 INFO L495 AbstractCegarLoop]: Abstraction has 1646 states and 2269 transitions. [2022-11-23 14:15:13,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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-11-23 14:15:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2269 transitions. [2022-11-23 14:15:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-23 14:15:13,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:15:13,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:15:13,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-23 14:15:13,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:13,673 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:15:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:15:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash -233122724, now seen corresponding path program 1 times [2022-11-23 14:15:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:15:13,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164685771] [2022-11-23 14:15:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:15:13,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:13,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:15:13,676 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:15:13,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-23 14:15:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:15:14,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 14:15:14,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:15:14,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 7 [2022-11-23 14:15:14,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:15:14,669 WARN L859 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_1107 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |alt_malloc_#res.base| v_ArrVal_1107))) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2022-11-23 14:15:14,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:14,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 14:15:14,711 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:15:14,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:15:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:14,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:15:14,734 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:15:14,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164685771] [2022-11-23 14:15:14,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164685771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:15:14,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:15:14,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 14:15:14,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709766952] [2022-11-23 14:15:14,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:15:14,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:15:14,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:15:14,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:15:14,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2022-11-23 14:15:14,736 INFO L87 Difference]: Start difference. First operand 1646 states and 2269 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-11-23 14:15:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:15:22,285 INFO L93 Difference]: Finished difference Result 2840 states and 3874 transitions. [2022-11-23 14:15:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 14:15:22,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 73 [2022-11-23 14:15:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:15:22,291 INFO L225 Difference]: With dead ends: 2840 [2022-11-23 14:15:22,291 INFO L226 Difference]: Without dead ends: 2840 [2022-11-23 14:15:22,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2022-11-23 14:15:22,292 INFO L413 NwaCegarLoop]: 1040 mSDtfsCounter, 2204 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 3092 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2210 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 5021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1900 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:15:22,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2210 Valid, 2397 Invalid, 5021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3092 Invalid, 0 Unknown, 1900 Unchecked, 7.4s Time] [2022-11-23 14:15:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2022-11-23 14:15:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 1642. [2022-11-23 14:15:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1195 states have (on average 1.8410041841004183) internal successors, (2200), 1607 states have internal predecessors, (2200), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-23 14:15:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2257 transitions. [2022-11-23 14:15:22,325 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2257 transitions. Word has length 73 [2022-11-23 14:15:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:15:22,326 INFO L495 AbstractCegarLoop]: Abstraction has 1642 states and 2257 transitions. [2022-11-23 14:15:22,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-11-23 14:15:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2257 transitions. [2022-11-23 14:15:22,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-23 14:15:22,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:15:22,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:15:22,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-23 14:15:22,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:22,540 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:15:22,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:15:22,540 INFO L85 PathProgramCache]: Analyzing trace with hash -159183299, now seen corresponding path program 1 times [2022-11-23 14:15:22,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:15:22,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539621739] [2022-11-23 14:15:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:15:22,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:22,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:15:22,542 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:15:22,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-23 14:15:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:15:22,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 14:15:22,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:15:22,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:15:22,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:15:22,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:15:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:23,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:15:23,024 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:15:23,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539621739] [2022-11-23 14:15:23,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539621739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:15:23,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:15:23,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 14:15:23,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600887663] [2022-11-23 14:15:23,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:15:23,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 14:15:23,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:15:23,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 14:15:23,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:15:23,026 INFO L87 Difference]: Start difference. First operand 1642 states and 2257 transitions. Second operand has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:15:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:15:27,776 INFO L93 Difference]: Finished difference Result 1657 states and 2273 transitions. [2022-11-23 14:15:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 14:15:27,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2022-11-23 14:15:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:15:27,784 INFO L225 Difference]: With dead ends: 1657 [2022-11-23 14:15:27,784 INFO L226 Difference]: Without dead ends: 1657 [2022-11-23 14:15:27,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-23 14:15:27,785 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 23 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4068 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:15:27,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4068 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-23 14:15:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2022-11-23 14:15:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1656. [2022-11-23 14:15:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1207 states have (on average 1.835956917978459) internal successors, (2216), 1619 states have internal predecessors, (2216), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-23 14:15:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2273 transitions. [2022-11-23 14:15:27,812 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2273 transitions. Word has length 80 [2022-11-23 14:15:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:15:27,812 INFO L495 AbstractCegarLoop]: Abstraction has 1656 states and 2273 transitions. [2022-11-23 14:15:27,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:15:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2273 transitions. [2022-11-23 14:15:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-23 14:15:27,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:15:27,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:15:27,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-23 14:15:28,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:28,037 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:15:28,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:15:28,037 INFO L85 PathProgramCache]: Analyzing trace with hash -639714905, now seen corresponding path program 1 times [2022-11-23 14:15:28,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:15:28,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394564864] [2022-11-23 14:15:28,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:15:28,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:28,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:15:28,039 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:15:28,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-23 14:15:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:15:28,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-23 14:15:28,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:15:28,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:15:28,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:15:28,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:15:28,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-23 14:15:28,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 14:15:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:28,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:15:28,750 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:15:28,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394564864] [2022-11-23 14:15:28,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394564864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:15:28,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:15:28,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 14:15:28,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560103757] [2022-11-23 14:15:28,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:15:28,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 14:15:28,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:15:28,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 14:15:28,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-23 14:15:28,752 INFO L87 Difference]: Start difference. First operand 1656 states and 2273 transitions. Second operand has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:15:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:15:35,382 INFO L93 Difference]: Finished difference Result 1656 states and 2271 transitions. [2022-11-23 14:15:35,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 14:15:35,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2022-11-23 14:15:35,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:15:35,385 INFO L225 Difference]: With dead ends: 1656 [2022-11-23 14:15:35,386 INFO L226 Difference]: Without dead ends: 1656 [2022-11-23 14:15:35,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-23 14:15:35,387 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 19 mSDsluCounter, 3910 mSDsCounter, 0 mSdLazyCounter, 2866 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4864 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:15:35,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4864 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2866 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-11-23 14:15:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-11-23 14:15:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2022-11-23 14:15:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1207 states have (on average 1.8342999171499585) internal successors, (2214), 1619 states have internal predecessors, (2214), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-23 14:15:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2271 transitions. [2022-11-23 14:15:35,411 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2271 transitions. Word has length 81 [2022-11-23 14:15:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:15:35,411 INFO L495 AbstractCegarLoop]: Abstraction has 1656 states and 2271 transitions. [2022-11-23 14:15:35,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:15:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2271 transitions. [2022-11-23 14:15:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-23 14:15:35,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:15:35,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:15:35,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-23 14:15:35,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:35,627 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:15:35,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:15:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1094788593, now seen corresponding path program 1 times [2022-11-23 14:15:35,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:15:35,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603888573] [2022-11-23 14:15:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:15:35,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:35,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:15:35,629 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:15:35,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-23 14:15:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:15:36,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:15:36,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:15:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:36,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:15:36,045 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:15:36,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603888573] [2022-11-23 14:15:36,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603888573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:15:36,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:15:36,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:15:36,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706288766] [2022-11-23 14:15:36,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:15:36,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:15:36,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:15:36,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:15:36,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:15:36,052 INFO L87 Difference]: Start difference. First operand 1656 states and 2271 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 14:15:36,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:15:36,130 INFO L93 Difference]: Finished difference Result 1672 states and 2289 transitions. [2022-11-23 14:15:36,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:15:36,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 88 [2022-11-23 14:15:36,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:15:36,134 INFO L225 Difference]: With dead ends: 1672 [2022-11-23 14:15:36,134 INFO L226 Difference]: Without dead ends: 1666 [2022-11-23 14:15:36,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:15:36,135 INFO L413 NwaCegarLoop]: 962 mSDtfsCounter, 14 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:15:36,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2878 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:15:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2022-11-23 14:15:36,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2022-11-23 14:15:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1215 states have (on average 1.8304526748971193) internal successors, (2224), 1629 states have internal predecessors, (2224), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-23 14:15:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2283 transitions. [2022-11-23 14:15:36,157 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2283 transitions. Word has length 88 [2022-11-23 14:15:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:15:36,157 INFO L495 AbstractCegarLoop]: Abstraction has 1666 states and 2283 transitions. [2022-11-23 14:15:36,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 14:15:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2283 transitions. [2022-11-23 14:15:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-23 14:15:36,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:15:36,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:15:36,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-23 14:15:36,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:36,376 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:15:36,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:15:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1402763991, now seen corresponding path program 1 times [2022-11-23 14:15:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:15:36,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264650615] [2022-11-23 14:15:36,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:15:36,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:36,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:15:36,378 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:15:36,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-23 14:15:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:15:36,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:15:36,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:15:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:36,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:15:36,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:36,982 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:15:36,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264650615] [2022-11-23 14:15:36,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264650615] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:15:36,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [860251730] [2022-11-23 14:15:36,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:15:36,983 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:15:36,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:15:36,988 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:15:36,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-23 14:15:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:15:37,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:15:37,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:15:37,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:37,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:15:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:37,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [860251730] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:15:37,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732227300] [2022-11-23 14:15:37,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:15:37,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:15:37,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:15:37,746 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:15:37,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-23 14:15:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:15:38,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:15:38,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:15:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:38,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:15:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:38,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732227300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:15:38,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 14:15:38,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2022-11-23 14:15:38,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262288275] [2022-11-23 14:15:38,265 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 14:15:38,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 14:15:38,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:15:38,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 14:15:38,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-23 14:15:38,267 INFO L87 Difference]: Start difference. First operand 1666 states and 2283 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 14:15:38,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:15:38,555 INFO L93 Difference]: Finished difference Result 1692 states and 2313 transitions. [2022-11-23 14:15:38,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 14:15:38,561 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 89 [2022-11-23 14:15:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:15:38,565 INFO L225 Difference]: With dead ends: 1692 [2022-11-23 14:15:38,565 INFO L226 Difference]: Without dead ends: 1680 [2022-11-23 14:15:38,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-11-23 14:15:38,567 INFO L413 NwaCegarLoop]: 965 mSDtfsCounter, 58 mSDsluCounter, 3839 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 4804 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:15:38,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 4804 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:15:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2022-11-23 14:15:38,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1674. [2022-11-23 14:15:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1223 states have (on average 1.8266557645134913) internal successors, (2234), 1637 states have internal predecessors, (2234), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-23 14:15:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2293 transitions. [2022-11-23 14:15:38,627 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2293 transitions. Word has length 89 [2022-11-23 14:15:38,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:15:38,628 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 2293 transitions. [2022-11-23 14:15:38,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 14:15:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2293 transitions. [2022-11-23 14:15:38,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-23 14:15:38,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:15:38,633 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:15:38,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-23 14:15:38,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-23 14:15:39,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-11-23 14:15:39,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 14:15:39,248 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:15:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:15:39,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1478348943, now seen corresponding path program 2 times [2022-11-23 14:15:39,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:15:39,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423899429] [2022-11-23 14:15:39,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:15:39,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:15:39,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:15:39,251 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:15:39,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-23 14:15:39,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 14:15:39,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:15:39,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 14:15:39,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:15:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:40,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:15:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:40,468 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:15:40,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423899429] [2022-11-23 14:15:40,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423899429] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:15:40,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [490715538] [2022-11-23 14:15:40,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:15:40,469 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:15:40,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:15:40,472 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:15:40,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-23 14:15:42,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 14:15:42,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:15:42,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 14:15:42,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:15:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:42,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:15:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:15:42,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [490715538] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:15:42,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984947234] [2022-11-23 14:15:42,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:15:42,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:15:42,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:15:42,842 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:15:42,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-23 14:16:12,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 14:16:12,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:16:12,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-23 14:16:12,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:16:12,454 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:16:12,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:16:12,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:16:13,100 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:16:13,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:16:13,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 14:16:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:16:13,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:16:13,401 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-23 14:16:13,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-23 14:16:13,414 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2306) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2022-11-23 14:16:13,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984947234] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:16:13,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-23 14:16:13,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 14] total 29 [2022-11-23 14:16:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633813204] [2022-11-23 14:16:13,417 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-23 14:16:13,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-23 14:16:13,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:16:13,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 14:16:13,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=756, Unknown=3, NotChecked=56, Total=930 [2022-11-23 14:16:13,419 INFO L87 Difference]: Start difference. First operand 1674 states and 2293 transitions. Second operand has 29 states, 28 states have (on average 6.071428571428571) internal successors, (170), 27 states have internal predecessors, (170), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-23 14:16:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:16:33,221 INFO L93 Difference]: Finished difference Result 2193 states and 2951 transitions. [2022-11-23 14:16:33,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-23 14:16:33,221 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 6.071428571428571) internal successors, (170), 27 states have internal predecessors, (170), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 92 [2022-11-23 14:16:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:16:33,240 INFO L225 Difference]: With dead ends: 2193 [2022-11-23 14:16:33,240 INFO L226 Difference]: Without dead ends: 2181 [2022-11-23 14:16:33,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=645, Invalid=3478, Unknown=41, NotChecked=126, Total=4290 [2022-11-23 14:16:33,242 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 1020 mSDsluCounter, 8441 mSDsCounter, 0 mSdLazyCounter, 9378 mSolverCounterSat, 71 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 8948 SdHoareTripleChecker+Invalid, 9464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 9378 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-11-23 14:16:33,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 8948 Invalid, 9464 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [71 Valid, 9378 Invalid, 15 Unknown, 0 Unchecked, 17.7s Time] [2022-11-23 14:16:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2022-11-23 14:16:33,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 1691. [2022-11-23 14:16:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1241 states have (on average 1.8178887993553585) internal successors, (2256), 1654 states have internal predecessors, (2256), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-23 14:16:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2315 transitions. [2022-11-23 14:16:33,267 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2315 transitions. Word has length 92 [2022-11-23 14:16:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:16:33,267 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 2315 transitions. [2022-11-23 14:16:33,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 6.071428571428571) internal successors, (170), 27 states have internal predecessors, (170), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-23 14:16:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2315 transitions. [2022-11-23 14:16:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-23 14:16:33,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:16:33,269 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:16:33,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-23 14:16:33,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-23 14:16:33,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-11-23 14:16:33,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 14:16:33,887 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:16:33,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:16:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2075896398, now seen corresponding path program 1 times [2022-11-23 14:16:33,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:16:33,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006461684] [2022-11-23 14:16:33,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:16:33,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:16:33,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:16:33,890 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:16:33,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-23 14:16:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:16:34,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-23 14:16:34,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:16:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:16:34,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:16:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:16:35,711 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:16:35,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006461684] [2022-11-23 14:16:35,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006461684] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:16:35,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1720562431] [2022-11-23 14:16:35,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:16:35,712 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:16:35,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:16:35,713 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:16:35,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-23 14:16:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:16:36,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-23 14:16:36,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:16:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:16:36,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:16:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:16:36,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1720562431] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:16:36,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714001112] [2022-11-23 14:16:36,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:16:36,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:16:36,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:16:36,834 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:16:36,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-23 14:16:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:16:37,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 14:16:37,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:16:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:16:37,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:16:39,260 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:16:39,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714001112] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:16:39,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 14:16:39,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15, 15] total 41 [2022-11-23 14:16:39,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080464346] [2022-11-23 14:16:39,260 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 14:16:39,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-23 14:16:39,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:16:39,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-23 14:16:39,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1187, Unknown=0, NotChecked=0, Total=1640 [2022-11-23 14:16:39,263 INFO L87 Difference]: Start difference. First operand 1691 states and 2315 transitions. Second operand has 41 states, 41 states have (on average 3.048780487804878) internal successors, (125), 41 states have internal predecessors, (125), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-23 14:16:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:16:43,660 INFO L93 Difference]: Finished difference Result 1799 states and 2453 transitions. [2022-11-23 14:16:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-23 14:16:43,661 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.048780487804878) internal successors, (125), 41 states have internal predecessors, (125), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 98 [2022-11-23 14:16:43,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:16:43,667 INFO L225 Difference]: With dead ends: 1799 [2022-11-23 14:16:43,668 INFO L226 Difference]: Without dead ends: 1781 [2022-11-23 14:16:43,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1810, Invalid=3890, Unknown=0, NotChecked=0, Total=5700 [2022-11-23 14:16:43,670 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 340 mSDsluCounter, 15552 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 16534 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:16:43,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 16534 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 14:16:43,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2022-11-23 14:16:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1727. [2022-11-23 14:16:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1277 states have (on average 1.802662490211433) internal successors, (2302), 1690 states have internal predecessors, (2302), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-23 14:16:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2361 transitions. [2022-11-23 14:16:43,704 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2361 transitions. Word has length 98 [2022-11-23 14:16:43,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:16:43,704 INFO L495 AbstractCegarLoop]: Abstraction has 1727 states and 2361 transitions. [2022-11-23 14:16:43,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.048780487804878) internal successors, (125), 41 states have internal predecessors, (125), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-23 14:16:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2361 transitions. [2022-11-23 14:16:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-23 14:16:43,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:16:43,706 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:16:43,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-23 14:16:43,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-11-23 14:16:44,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-23 14:16:44,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:16:44,318 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:16:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:16:44,319 INFO L85 PathProgramCache]: Analyzing trace with hash -493120974, now seen corresponding path program 2 times [2022-11-23 14:16:44,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:16:44,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148576191] [2022-11-23 14:16:44,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:16:44,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:16:44,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:16:44,321 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:16:44,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-23 14:16:45,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 14:16:45,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:16:45,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-23 14:16:45,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:16:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:16:46,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:16:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:16:52,089 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:16:52,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148576191] [2022-11-23 14:16:52,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148576191] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:16:52,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [152570128] [2022-11-23 14:16:52,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:16:52,090 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:16:52,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:16:52,091 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:16:52,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-23 14:16:54,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 14:16:54,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:16:54,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-23 14:16:54,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:16:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:16:55,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:16:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:16:56,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [152570128] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:16:56,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988563995] [2022-11-23 14:16:56,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:16:56,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:16:56,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:16:56,965 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:16:56,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-23 14:17:39,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 14:17:39,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:17:39,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-23 14:17:39,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:17:39,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:17:39,682 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:17:39,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:17:39,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:17:39,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:17:40,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:17:40,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:17:44,362 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3657 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_3657))) (exists ((v_arrayElimCell_27 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_27) (_ bv44 32))) (exists ((v_ArrVal_3656 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_3656)))) is different from true [2022-11-23 14:17:44,422 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:17:44,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:17:44,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:17:44,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 14:17:44,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 14:17:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 22 not checked. [2022-11-23 14:17:44,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:17:45,743 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3704 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3705) |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~mem73#1.base| v_ArrVal_3704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3705 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3705) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-23 14:17:45,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988563995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:17:45,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-23 14:17:45,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27, 27, 13] total 64 [2022-11-23 14:17:45,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004946988] [2022-11-23 14:17:45,751 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-23 14:17:45,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-23 14:17:45,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:17:45,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-23 14:17:45,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=3404, Unknown=3, NotChecked=254, Total=4422 [2022-11-23 14:17:45,754 INFO L87 Difference]: Start difference. First operand 1727 states and 2361 transitions. Second operand has 64 states, 63 states have (on average 3.2698412698412698) internal successors, (206), 61 states have internal predecessors, (206), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-23 14:19:39,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:19:39,880 INFO L93 Difference]: Finished difference Result 2402 states and 3249 transitions. [2022-11-23 14:19:39,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-23 14:19:39,881 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.2698412698412698) internal successors, (206), 61 states have internal predecessors, (206), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 110 [2022-11-23 14:19:39,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:19:39,884 INFO L225 Difference]: With dead ends: 2402 [2022-11-23 14:19:39,884 INFO L226 Difference]: Without dead ends: 2384 [2022-11-23 14:19:39,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 459 SyntacticMatches, 27 SemanticMatches, 148 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6360 ImplicationChecksByTransitivity, 41.7s TimeCoverageRelationStatistics Valid=3676, Invalid=18057, Unknown=31, NotChecked=586, Total=22350 [2022-11-23 14:19:39,888 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 2280 mSDsluCounter, 15885 mSDsCounter, 0 mSdLazyCounter, 22968 mSolverCounterSat, 379 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2314 SdHoareTripleChecker+Valid, 16403 SdHoareTripleChecker+Invalid, 24858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 22968 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 1504 IncrementalHoareTripleChecker+Unchecked, 82.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:19:39,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2314 Valid, 16403 Invalid, 24858 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [379 Valid, 22968 Invalid, 7 Unknown, 1504 Unchecked, 82.4s Time] [2022-11-23 14:19:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2022-11-23 14:19:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1798. [2022-11-23 14:19:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1349 states have (on average 1.776130467012602) internal successors, (2396), 1761 states have internal predecessors, (2396), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-23 14:19:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2455 transitions. [2022-11-23 14:19:39,924 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2455 transitions. Word has length 110 [2022-11-23 14:19:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:19:39,925 INFO L495 AbstractCegarLoop]: Abstraction has 1798 states and 2455 transitions. [2022-11-23 14:19:39,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.2698412698412698) internal successors, (206), 61 states have internal predecessors, (206), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-23 14:19:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2455 transitions. [2022-11-23 14:19:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-23 14:19:39,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:19:39,927 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:19:39,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-23 14:19:40,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2022-11-23 14:19:40,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-23 14:19:40,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:19:40,540 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:19:40,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:19:40,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1934250012, now seen corresponding path program 1 times [2022-11-23 14:19:40,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:19:40,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873647494] [2022-11-23 14:19:40,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:19:40,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:19:40,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:19:40,543 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:19:40,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-23 14:19:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:19:41,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-23 14:19:41,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:19:41,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:19:41,706 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 14:19:41,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 14:19:41,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:19:41,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 14:19:44,567 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:19:44,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:19:44,719 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:19:44,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:19:44,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 14:19:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-23 14:19:44,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:19:44,893 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4145) |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-11-23 14:19:44,906 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4145 (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_4145) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-23 14:19:45,265 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4145 (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~mem73#1.base| v_ArrVal_4191))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4145)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 14:19:45,268 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:19:45,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873647494] [2022-11-23 14:19:45,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873647494] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:19:45,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2120017904] [2022-11-23 14:19:45,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:19:45,269 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:19:45,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:19:45,272 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:19:45,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-23 14:19:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:19:50,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-23 14:19:50,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:19:50,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:19:50,630 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 14:19:50,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 14:19:50,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:19:50,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 14:19:53,139 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:19:53,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:19:53,242 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:19:53,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:19:53,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 14:19:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-23 14:19:53,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:19:53,298 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4631) |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-11-23 14:19:53,311 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 14:19:53,657 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4631 (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 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4677))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4631)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-23 14:19:53,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2120017904] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:19:53,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575330774] [2022-11-23 14:19:53,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:19:53,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:19:53,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:19:53,662 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:19:53,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-23 14:19:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:19:54,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-23 14:19:54,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:19:54,566 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:19:54,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:19:54,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:19:57,278 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5114))) is different from true [2022-11-23 14:19:57,308 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:19:57,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-23 14:19:57,407 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:19:57,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-11-23 14:19:57,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 14:19:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-23 14:19:57,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:19:57,525 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-23 14:19:57,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-23 14:19:57,534 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem74#1.base|)) is different from false [2022-11-23 14:19:57,544 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-23 14:19:57,877 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5161)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-11-23 14:19:57,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575330774] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:19:57,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:19:57,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 25 [2022-11-23 14:19:57,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822584313] [2022-11-23 14:19:57,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:19:57,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 14:19:57,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:19:57,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 14:19:57,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=560, Unknown=30, NotChecked=570, Total=1260 [2022-11-23 14:19:57,881 INFO L87 Difference]: Start difference. First operand 1798 states and 2455 transitions. Second operand has 26 states, 23 states have (on average 5.0) internal successors, (115), 22 states have internal predecessors, (115), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-23 14:20:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:20:20,402 INFO L93 Difference]: Finished difference Result 2274 states and 3057 transitions. [2022-11-23 14:20:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 14:20:20,402 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.0) internal successors, (115), 22 states have internal predecessors, (115), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 135 [2022-11-23 14:20:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:20:20,405 INFO L225 Difference]: With dead ends: 2274 [2022-11-23 14:20:20,405 INFO L226 Difference]: Without dead ends: 2274 [2022-11-23 14:20:20,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 260 SyntacticMatches, 133 SemanticMatches, 48 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=214, Invalid=1340, Unknown=46, NotChecked=850, Total=2450 [2022-11-23 14:20:20,407 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 1725 mSDsluCounter, 7207 mSDsCounter, 0 mSdLazyCounter, 8394 mSolverCounterSat, 53 mSolverCounterUnsat, 942 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1728 SdHoareTripleChecker+Valid, 7696 SdHoareTripleChecker+Invalid, 10780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 8394 IncrementalHoareTripleChecker+Invalid, 942 IncrementalHoareTripleChecker+Unknown, 1391 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:20:20,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1728 Valid, 7696 Invalid, 10780 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 8394 Invalid, 942 Unknown, 1391 Unchecked, 21.6s Time] [2022-11-23 14:20:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2022-11-23 14:20:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1795. [2022-11-23 14:20:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1349 states have (on average 1.7716827279466272) internal successors, (2390), 1758 states have internal predecessors, (2390), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-23 14:20:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2449 transitions. [2022-11-23 14:20:20,446 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2449 transitions. Word has length 135 [2022-11-23 14:20:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:20:20,446 INFO L495 AbstractCegarLoop]: Abstraction has 1795 states and 2449 transitions. [2022-11-23 14:20:20,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.0) internal successors, (115), 22 states have internal predecessors, (115), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-23 14:20:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2449 transitions. [2022-11-23 14:20:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-23 14:20:20,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:20:20,448 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:20:20,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-11-23 14:20:20,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-11-23 14:20:20,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-23 14:20:21,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:20:21,069 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:20:21,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:20:21,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1934250013, now seen corresponding path program 1 times [2022-11-23 14:20:21,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:20:21,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942027753] [2022-11-23 14:20:21,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:20:21,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:20:21,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:20:21,072 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:20:21,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-11-23 14:20:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:20:22,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-23 14:20:22,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:20:22,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:20:22,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:20:22,655 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:20:22,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:20:22,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:20:22,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:20:22,855 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-11-23 14:20:22,860 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-11-23 14:20:25,184 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5646) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5645 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5645) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 14:20:25,235 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:20:25,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:20:25,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:20:25,401 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:20:25,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:20:25,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:20:25,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 25 treesize of output 13 [2022-11-23 14:20:25,447 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-11-23 14:20:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-23 14:20:25,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:20:25,701 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5648) |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~mem74#1.base| v_ArrVal_5647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-23 14:20:25,743 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_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-23 14:20:26,791 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5740))) (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~mem73#1.base| v_ArrVal_5739) .cse0 v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-23 14:20:26,802 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:20:26,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942027753] [2022-11-23 14:20:26,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942027753] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:20:26,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1765157495] [2022-11-23 14:20:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:20:26,803 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:20:26,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:20:26,804 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:20:26,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-11-23 14:20:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:20:31,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-23 14:20:31,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:20:31,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:20:31,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:20:31,986 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:20:31,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:20:31,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 14:20:32,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:20:32,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:20:32,205 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 20 treesize of output 8 [2022-11-23 14:20:32,292 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 7 treesize of output 3 [2022-11-23 14:20:36,556 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 16 treesize of output 18 [2022-11-23 14:20:36,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:20:36,810 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2022-11-23 14:20:36,841 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-23 14:20:36,841 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 60 treesize of output 44 [2022-11-23 14:20:37,009 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 15 [2022-11-23 14:20:37,013 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 26 treesize of output 14 [2022-11-23 14:20:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-23 14:20:37,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:20:37,650 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 231 treesize of output 159 [2022-11-23 14:20:46,413 WARN L233 SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 63 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:20:46,885 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6232))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_6185 (_ BitVec 32))) (let ((.cse0 (select (select (store .cse1 v_arrayElimCell_72 (store (select .cse1 v_arrayElimCell_72) (bvadd (_ bv16 32) .cse2) v_ArrVal_6185)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (not (bvule (bvadd .cse2 (_ bv20 32)) (select |c_#length| v_arrayElimCell_72))))))) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6232))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse6 (select |c_#length| v_arrayElimCell_72))) (or (bvule (bvadd (_ bv8 32) (select (select (store .cse4 v_arrayElimCell_72 (store (select .cse4 v_arrayElimCell_72) (bvadd (_ bv16 32) .cse5) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) .cse6) (not (bvule (bvadd .cse5 (_ bv20 32)) .cse6)))))))) is different from false [2022-11-23 14:20:46,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1765157495] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:20:46,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731784870] [2022-11-23 14:20:46,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:20:46,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:20:46,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:20:46,905 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:20:46,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-23 14:20:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:20:47,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-23 14:20:47,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:20:47,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:20:48,010 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:20:48,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:20:48,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:20:48,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:20:48,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:20:48,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:20:51,286 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_6716 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6716))) (exists ((v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6715) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 14:20:51,341 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:20:51,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:20:51,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:20:51,707 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:20:51,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:20:51,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:20:51,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 14:20:51,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 14:20:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-23 14:20:51,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:20:51,829 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 14:20:51,868 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_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-23 14:20:52,953 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6809))) (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~mem73#1.base| v_ArrVal_6810) .cse0 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6810) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-23 14:20:52,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731784870] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:20:52,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:20:52,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 36 [2022-11-23 14:20:52,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196015318] [2022-11-23 14:20:52,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:20:52,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-23 14:20:52,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:20:52,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-23 14:20:52,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1338, Unknown=44, NotChecked=738, Total=2256 [2022-11-23 14:20:52,967 INFO L87 Difference]: Start difference. First operand 1795 states and 2449 transitions. Second operand has 37 states, 33 states have (on average 7.212121212121212) internal successors, (238), 31 states have internal predecessors, (238), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-23 14:21:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:21:57,160 INFO L93 Difference]: Finished difference Result 2948 states and 3957 transitions. [2022-11-23 14:21:57,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 14:21:57,160 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 7.212121212121212) internal successors, (238), 31 states have internal predecessors, (238), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 135 [2022-11-23 14:21:57,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:21:57,164 INFO L225 Difference]: With dead ends: 2948 [2022-11-23 14:21:57,164 INFO L226 Difference]: Without dead ends: 2948 [2022-11-23 14:21:57,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 249 SyntacticMatches, 131 SemanticMatches, 61 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1712 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=278, Invalid=2559, Unknown=61, NotChecked=1008, Total=3906 [2022-11-23 14:21:57,165 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 2597 mSDsluCounter, 10191 mSDsCounter, 0 mSdLazyCounter, 22800 mSolverCounterSat, 63 mSolverCounterUnsat, 1277 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2602 SdHoareTripleChecker+Valid, 10844 SdHoareTripleChecker+Invalid, 27542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 22800 IncrementalHoareTripleChecker+Invalid, 1277 IncrementalHoareTripleChecker+Unknown, 3402 IncrementalHoareTripleChecker+Unchecked, 61.9s IncrementalHoareTripleChecker+Time [2022-11-23 14:21:57,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2602 Valid, 10844 Invalid, 27542 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [63 Valid, 22800 Invalid, 1277 Unknown, 3402 Unchecked, 61.9s Time] [2022-11-23 14:21:57,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2022-11-23 14:21:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 2096. [2022-11-23 14:21:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 1644 states have (on average 1.7919708029197081) internal successors, (2946), 2054 states have internal predecessors, (2946), 33 states have call successors, (33), 18 states have call predecessors, (33), 18 states have return successors, (36), 26 states have call predecessors, (36), 33 states have call successors, (36) [2022-11-23 14:21:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3015 transitions. [2022-11-23 14:21:57,195 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 3015 transitions. Word has length 135 [2022-11-23 14:21:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:21:57,196 INFO L495 AbstractCegarLoop]: Abstraction has 2096 states and 3015 transitions. [2022-11-23 14:21:57,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 7.212121212121212) internal successors, (238), 31 states have internal predecessors, (238), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-23 14:21:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3015 transitions. [2022-11-23 14:21:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-23 14:21:57,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:21:57,198 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:21:57,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2022-11-23 14:21:57,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-23 14:21:57,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-11-23 14:21:57,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:21:57,819 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:21:57,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:21:57,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1961199032, now seen corresponding path program 1 times [2022-11-23 14:21:57,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:21:57,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585248526] [2022-11-23 14:21:57,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:21:57,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-11-23 14:21:57,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:21:57,821 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:21:57,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-11-23 14:21:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:21:59,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-23 14:21:59,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:21:59,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:21:59,316 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 14:21:59,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 14:21:59,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:21:59,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 14:22:02,516 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:22:02,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:22:02,679 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:22:02,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:22:02,815 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:22:02,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:22:02,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 14:22:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-23 14:22:02,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:22:05,125 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7266 (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_7266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-23 14:22:05,147 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7266 (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~mem74#1.base| v_ArrVal_7265))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7266)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 14:22:05,164 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7266 (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_7265))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7266)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 14:22:05,555 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (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~mem73#1.base| v_ArrVal_7312))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7265)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7266)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 14:22:05,559 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:22:05,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585248526] [2022-11-23 14:22:05,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585248526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:22:05,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [802519285] [2022-11-23 14:22:05,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:22:05,560 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:22:05,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:22:05,561 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:22:05,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-11-23 14:22:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:22:16,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-23 14:22:16,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:22:16,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:22:16,863 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 14:22:16,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 14:22:16,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:22:16,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 14:22:19,816 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:22:19,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:22:19,914 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:22:19,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:22:19,978 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:22:19,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:22:20,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 14:22:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-23 14:22:20,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:22:20,039 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7768) |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-11-23 14:22:20,053 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (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_7768) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-23 14:22:20,074 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7767 (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~mem74#1.base| v_ArrVal_7767))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7768)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 14:22:20,668 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7767 (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~mem73#1.base| v_ArrVal_7814))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7767)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7768)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 14:22:20,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [802519285] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:22:20,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975823052] [2022-11-23 14:22:20,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:22:20,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:22:20,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:22:20,675 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:22:20,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-23 14:22:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:22:21,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-23 14:22:21,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:22:21,904 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:22:21,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:22:21,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:22:25,779 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:22:25,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:22:26,016 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:22:26,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:22:26,165 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:22:26,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:22:26,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 14:22:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-23 14:22:26,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:22:26,214 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8268) |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-11-23 14:22:26,229 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (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_8268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2022-11-23 14:22:26,250 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8267 (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~mem74#1.base| v_ArrVal_8267))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8268)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 14:22:26,267 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8267 (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 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8267))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8268)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-23 14:22:26,690 INFO L321 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2022-11-23 14:22:26,690 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 61 treesize of output 60 [2022-11-23 14:22:26,706 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8314 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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~mem73#1.base| v_ArrVal_8314))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8267)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8268)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2022-11-23 14:22:26,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975823052] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:22:26,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:22:26,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 28 [2022-11-23 14:22:26,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276240477] [2022-11-23 14:22:26,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:22:26,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-23 14:22:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:22:26,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 14:22:26,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=856, Unknown=48, NotChecked=936, Total=1980 [2022-11-23 14:22:26,712 INFO L87 Difference]: Start difference. First operand 2096 states and 3015 transitions. Second operand has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-23 14:22:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:22:54,449 INFO L93 Difference]: Finished difference Result 2574 states and 3621 transitions. [2022-11-23 14:22:54,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 14:22:54,450 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 138 [2022-11-23 14:22:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:22:54,452 INFO L225 Difference]: With dead ends: 2574 [2022-11-23 14:22:54,452 INFO L226 Difference]: Without dead ends: 2574 [2022-11-23 14:22:54,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 269 SyntacticMatches, 131 SemanticMatches, 60 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1886 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=296, Invalid=2039, Unknown=69, NotChecked=1378, Total=3782 [2022-11-23 14:22:54,453 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 1728 mSDsluCounter, 7608 mSDsCounter, 0 mSdLazyCounter, 8788 mSolverCounterSat, 52 mSolverCounterUnsat, 1012 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 8096 SdHoareTripleChecker+Invalid, 9852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 8788 IncrementalHoareTripleChecker+Invalid, 1012 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:22:54,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 8096 Invalid, 9852 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 8788 Invalid, 1012 Unknown, 0 Unchecked, 26.4s Time] [2022-11-23 14:22:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2022-11-23 14:22:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2095. [2022-11-23 14:22:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2095 states, 1644 states have (on average 1.7907542579075426) internal successors, (2944), 2053 states have internal predecessors, (2944), 33 states have call successors, (33), 18 states have call predecessors, (33), 18 states have return successors, (36), 26 states have call predecessors, (36), 33 states have call successors, (36) [2022-11-23 14:22:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 3013 transitions. [2022-11-23 14:22:54,492 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 3013 transitions. Word has length 138 [2022-11-23 14:22:54,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:22:54,493 INFO L495 AbstractCegarLoop]: Abstraction has 2095 states and 3013 transitions. [2022-11-23 14:22:54,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-23 14:22:54,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 3013 transitions. [2022-11-23 14:22:54,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-23 14:22:54,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:22:54,495 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:22:54,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Ended with exit code 0 [2022-11-23 14:22:54,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-11-23 14:22:54,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2022-11-23 14:22:55,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 14:22:55,103 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:22:55,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:22:55,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1961199033, now seen corresponding path program 1 times [2022-11-23 14:22:55,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:22:55,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873598056] [2022-11-23 14:22:55,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:22:55,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:22:55,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:22:55,106 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:22:55,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-11-23 14:22:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:22:56,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-23 14:22:56,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:22:56,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:22:56,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:22:56,880 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:22:56,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:22:56,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:22:56,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:22:57,143 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-11-23 14:22:57,151 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-11-23 14:23:00,146 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_107 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_107) (_ bv44 32))) (exists ((v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8813))) (exists ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8814) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 14:23:00,205 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:23:00,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:23:00,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:23:00,399 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:23:00,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:23:00,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:23:00,565 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:23:00,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:23:00,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:23:00,618 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-11-23 14:23:00,622 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-11-23 14:23:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-23 14:23:00,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:23:01,032 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8818) |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~mem75#1.base| v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 14:23:01,083 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_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-23 14:23:01,164 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8816))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8815) .cse0 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8815) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-23 14:23:01,225 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_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8816))) (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_8815) .cse1 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8815) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-23 14:23:02,360 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8909 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8909))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8816))) (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~mem73#1.base| v_ArrVal_8910) .cse0 v_ArrVal_8815) .cse1 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8909 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8909))) (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~mem73#1.base| v_ArrVal_8910) .cse6 v_ArrVal_8815) (select (select (store .cse7 .cse6 v_ArrVal_8816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8818))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-23 14:23:02,376 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:23:02,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873598056] [2022-11-23 14:23:02,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873598056] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:23:02,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1203606567] [2022-11-23 14:23:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:23:02,377 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:23:02,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:23:02,378 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:23:02,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-11-23 14:23:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:23:09,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 125 conjunts are in the unsatisfiable core [2022-11-23 14:23:09,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:23:09,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:23:09,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:23:09,437 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:23:09,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:23:09,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:23:09,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:23:09,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 22 treesize of output 10 [2022-11-23 14:23:09,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:23:12,599 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_9409) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_107 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_107) (_ bv44 32))) (exists ((v_ArrVal_9410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_9410)))) is different from true [2022-11-23 14:23:12,659 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:23:12,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:23:12,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:23:12,911 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:23:12,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:23:12,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:23:13,079 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:23:13,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:23:13,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:23:13,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 14:23:13,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 14:23:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-23 14:23:13,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:23:13,213 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9413) |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~mem75#1.base| v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 14:23:13,251 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_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-23 14:23:13,321 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9411))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9412) .cse0 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9412) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-23 14:23:16,316 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9505))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9506) .cse1 v_ArrVal_9412) (select (select (store .cse2 .cse1 v_ArrVal_9411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9413))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9505))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9411))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9506) .cse4 v_ArrVal_9412) .cse5 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-23 14:23:16,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1203606567] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:23:16,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294220514] [2022-11-23 14:23:16,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:23:16,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:23:16,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:23:16,335 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:23:16,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-23 14:23:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:23:17,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-23 14:23:17,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:23:17,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:23:17,673 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:23:17,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:23:17,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:23:17,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:23:17,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:23:17,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:23:21,937 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10005))) (exists ((v_arrayElimCell_107 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_107) (_ bv44 32))) (exists ((v_ArrVal_10004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10004)))) is different from true [2022-11-23 14:23:22,029 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:23:22,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:23:22,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:23:22,250 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:23:22,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:23:22,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:23:22,360 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:23:22,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:23:22,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:23:22,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 14:23:22,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 14:23:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-23 14:23:22,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:23:22,521 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10009) |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~mem75#1.base| v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 14:23:22,569 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_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-23 14:23:22,728 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10006))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10007) .cse0 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10007) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-23 14:23:22,897 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_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10007) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10006))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10007) .cse3 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-23 14:23:25,218 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10100))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10101) .cse1 v_ArrVal_10007) (select (select (store .cse2 .cse1 v_ArrVal_10006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10009))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10100))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10006))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10101) .cse4 v_ArrVal_10007) .cse5 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-23 14:23:25,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294220514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:23:25,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:23:25,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 25 [2022-11-23 14:23:25,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366490360] [2022-11-23 14:23:25,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:23:25,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 14:23:25,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:23:25,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 14:23:25,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=567, Unknown=33, NotChecked=1088, Total=1806 [2022-11-23 14:23:25,243 INFO L87 Difference]: Start difference. First operand 2095 states and 3013 transitions. Second operand has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-23 14:24:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:17,044 INFO L93 Difference]: Finished difference Result 2922 states and 3931 transitions. [2022-11-23 14:24:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 14:24:17,045 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 138 [2022-11-23 14:24:17,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:17,048 INFO L225 Difference]: With dead ends: 2922 [2022-11-23 14:24:17,048 INFO L226 Difference]: Without dead ends: 2922 [2022-11-23 14:24:17,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 268 SyntacticMatches, 134 SemanticMatches, 53 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1427 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=214, Invalid=1221, Unknown=39, NotChecked=1496, Total=2970 [2022-11-23 14:24:17,049 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 1991 mSDsluCounter, 7267 mSDsCounter, 0 mSdLazyCounter, 14106 mSolverCounterSat, 32 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1996 SdHoareTripleChecker+Valid, 8056 SdHoareTripleChecker+Invalid, 18579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 14106 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 4434 IncrementalHoareTripleChecker+Unchecked, 49.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:17,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1996 Valid, 8056 Invalid, 18579 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [32 Valid, 14106 Invalid, 7 Unknown, 4434 Unchecked, 49.4s Time] [2022-11-23 14:24:17,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-11-23 14:24:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2094. [2022-11-23 14:24:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2094 states, 1644 states have (on average 1.789537712895377) internal successors, (2942), 2052 states have internal predecessors, (2942), 33 states have call successors, (33), 18 states have call predecessors, (33), 18 states have return successors, (36), 26 states have call predecessors, (36), 33 states have call successors, (36) [2022-11-23 14:24:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3011 transitions. [2022-11-23 14:24:17,080 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3011 transitions. Word has length 138 [2022-11-23 14:24:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:17,080 INFO L495 AbstractCegarLoop]: Abstraction has 2094 states and 3011 transitions. [2022-11-23 14:24:17,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-23 14:24:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3011 transitions. [2022-11-23 14:24:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-23 14:24:17,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:17,083 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:17,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-11-23 14:24:17,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:17,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:17,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 14:24:17,697 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:24:17,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1640576451, now seen corresponding path program 1 times [2022-11-23 14:24:17,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:24:17,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252082528] [2022-11-23 14:24:17,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:17,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:24:17,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:24:17,700 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:24:17,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-11-23 14:24:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:19,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-23 14:24:19,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:19,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:24:19,806 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 14:24:19,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 14:24:19,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:24:20,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 14:24:24,357 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:24:24,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:24:24,588 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:24:24,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:24:24,786 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:24:24,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-11-23 14:24:24,988 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:24:24,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:24:25,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 14:24:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-23 14:24:25,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:25,310 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10573) |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-11-23 14:24:25,330 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10573 (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_10573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-11-23 14:24:25,360 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (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~mem75#1.base| v_ArrVal_10572))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 14:24:25,383 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (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_10572))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 14:24:25,417 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (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~mem74#1.base| v_ArrVal_10571))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10572)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 14:24:25,444 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10571))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10572)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 14:24:25,995 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (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~mem73#1.base| v_ArrVal_10619))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10571)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10572)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 14:24:26,001 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:24:26,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252082528] [2022-11-23 14:24:26,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252082528] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:26,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2112725194] [2022-11-23 14:24:26,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:26,002 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:24:26,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:24:26,003 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:24:26,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-11-23 14:24:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:34,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-23 14:24:34,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:34,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:24:35,037 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 14:24:35,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 14:24:35,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:24:35,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 14:24:39,393 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:24:39,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:24:39,544 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:24:39,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:24:39,651 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:24:39,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:24:39,769 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:24:39,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:24:39,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 14:24:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-23 14:24:39,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:42,033 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11091 (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_11091) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-23 14:24:42,062 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (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 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_11090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 14:24:42,292 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (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~mem74#1.base| v_ArrVal_11089))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11090)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 14:24:42,319 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (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 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11089))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11090)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-23 14:24:42,846 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (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 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_11137))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11089)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11090)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 14:24:42,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2112725194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:42,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534865812] [2022-11-23 14:24:42,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:42,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:42,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:42,872 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:42,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-23 14:24:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:43,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-23 14:24:43,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:44,318 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:24:44,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:24:44,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:24:50,217 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_11604 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_11604))) is different from true [2022-11-23 14:24:50,269 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:24:50,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-23 14:24:50,472 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:24:50,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 23 treesize of output 26 [2022-11-23 14:24:50,660 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:24:50,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-23 14:24:50,866 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:24:50,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 36 treesize of output 37 [2022-11-23 14:24:51,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 14:24:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-23 14:24:51,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:51,091 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-23 14:24:51,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-23 14:24:51,377 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-23 14:24:51,405 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_11606)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-11-23 14:24:51,422 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-23 14:24:51,451 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11605 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_11605))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-23 14:24:51,472 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11605 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11605))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2022-11-23 14:24:52,024 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11605 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_11653))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11605)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-23 14:24:52,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534865812] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:52,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:24:52,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 29 [2022-11-23 14:24:52,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279417332] [2022-11-23 14:24:52,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:52,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-23 14:24:52,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:24:52,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-23 14:24:52,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=905, Unknown=72, NotChecked=1520, Total=2652 [2022-11-23 14:24:52,033 INFO L87 Difference]: Start difference. First operand 2094 states and 3011 transitions. Second operand has 30 states, 27 states have (on average 4.703703703703703) internal successors, (127), 26 states have internal predecessors, (127), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-23 14:25:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:25:34,062 INFO L93 Difference]: Finished difference Result 2572 states and 3617 transitions. [2022-11-23 14:25:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 14:25:34,062 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 4.703703703703703) internal successors, (127), 26 states have internal predecessors, (127), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 141 [2022-11-23 14:25:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:25:34,065 INFO L225 Difference]: With dead ends: 2572 [2022-11-23 14:25:34,065 INFO L226 Difference]: Without dead ends: 2572 [2022-11-23 14:25:34,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 280 SyntacticMatches, 133 SemanticMatches, 66 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 1881 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=302, Invalid=2034, Unknown=92, NotChecked=2128, Total=4556 [2022-11-23 14:25:34,067 INFO L413 NwaCegarLoop]: 487 mSDtfsCounter, 1714 mSDsluCounter, 8083 mSDsCounter, 0 mSdLazyCounter, 9361 mSolverCounterSat, 53 mSolverCounterUnsat, 911 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 8570 SdHoareTripleChecker+Invalid, 11713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 9361 IncrementalHoareTripleChecker+Invalid, 911 IncrementalHoareTripleChecker+Unknown, 1388 IncrementalHoareTripleChecker+Unchecked, 40.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:25:34,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 8570 Invalid, 11713 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 9361 Invalid, 911 Unknown, 1388 Unchecked, 40.0s Time] [2022-11-23 14:25:34,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2022-11-23 14:25:34,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2093. [2022-11-23 14:25:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1644 states have (on average 1.7883211678832116) internal successors, (2940), 2051 states have internal predecessors, (2940), 33 states have call successors, (33), 18 states have call predecessors, (33), 18 states have return successors, (36), 26 states have call predecessors, (36), 33 states have call successors, (36) [2022-11-23 14:25:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 3009 transitions. [2022-11-23 14:25:34,093 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 3009 transitions. Word has length 141 [2022-11-23 14:25:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:25:34,094 INFO L495 AbstractCegarLoop]: Abstraction has 2093 states and 3009 transitions. [2022-11-23 14:25:34,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 4.703703703703703) internal successors, (127), 26 states have internal predecessors, (127), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-23 14:25:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 3009 transitions. [2022-11-23 14:25:34,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-23 14:25:34,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:25:34,096 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:25:34,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Ended with exit code 0 [2022-11-23 14:25:34,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2022-11-23 14:25:34,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-23 14:25:34,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:25:34,719 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-23 14:25:34,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:25:34,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1640576452, now seen corresponding path program 1 times [2022-11-23 14:25:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:25:34,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877448198] [2022-11-23 14:25:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:25:34,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:25:34,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:25:34,722 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:25:34,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-11-23 14:25:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:25:36,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 129 conjunts are in the unsatisfiable core [2022-11-23 14:25:36,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:25:36,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 14:25:37,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:25:37,192 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:25:37,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:25:37,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:25:37,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:25:37,568 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-11-23 14:25:37,575 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-11-23 14:25:41,725 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_168 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_168) (_ bv44 32))) (exists ((v_ArrVal_12168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_12168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_12167 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_12167)))) is different from true [2022-11-23 14:25:41,804 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:25:41,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:25:41,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:25:42,065 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:25:42,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:25:42,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:25:42,282 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:25:42,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:25:42,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:25:42,523 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:25:42,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 14:25:42,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 14:25:42,584 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-11-23 14:25:42,588 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-11-23 14:25:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-23 14:25:42,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:25:43,013 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 14:25:43,064 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_12174 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-23 14:25:43,201 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12172) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12171))) (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~mem75#1.base| v_ArrVal_12172) .cse2 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-23 14:25:43,273 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_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12171))) (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_12172) .cse1 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12172) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2022-11-23 14:25:43,896 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12170))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12169) .cse1 v_ArrVal_12172) (select (select (store .cse2 .cse1 v_ArrVal_12171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12174))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12170))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_12171))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12169) .cse4 v_ArrVal_12172) .cse5 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-23 14:25:45,163 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_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12170))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12171))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12169) .cse1 v_ArrVal_12172) .cse2 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12170))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12169) .cse7 v_ArrVal_12172) (select (select (store .cse8 .cse7 v_ArrVal_12171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12174))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2022-11-23 14:25:48,869 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12266))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_12170))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12265) .cse1 v_ArrVal_12169) .cse2 v_ArrVal_12172) (select (select (store .cse3 .cse2 v_ArrVal_12171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12174))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12266))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_12170))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_12171))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12265) .cse6 v_ArrVal_12169) .cse7 v_ArrVal_12172) .cse8 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2022-11-23 14:25:48,900 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:25:48,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877448198] [2022-11-23 14:25:48,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877448198] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:25:48,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1688892505] [2022-11-23 14:25:48,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:25:48,901 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:25:48,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:25:48,902 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:25:48,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eecacfb5-ac87-49cf-aa50-ae6a0d9ef59f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process