./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur --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 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 --- 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-38b53e6 [2022-11-25 22:42:40,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:42:40,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:42:40,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:42:40,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:42:40,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:42:40,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:42:40,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:42:40,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:42:40,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:42:40,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:42:40,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:42:40,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:42:40,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:42:40,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:42:40,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:42:40,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:42:40,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:42:40,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:42:40,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:42:40,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:42:40,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:42:40,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:42:40,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:42:40,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:42:40,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:42:40,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:42:40,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:42:40,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:42:40,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:42:40,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:42:40,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:42:40,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:42:40,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:42:40,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:42:40,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:42:40,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:42:40,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:42:40,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:42:40,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:42:40,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:42:40,922 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 22:42:40,955 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:42:40,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:42:40,961 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:42:40,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:42:40,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:42:40,963 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:42:40,963 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:42:40,964 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:42:40,964 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:42:40,964 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:42:40,965 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:42:40,965 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:42:40,966 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:42:40,966 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:42:40,966 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:42:40,967 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:42:40,967 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:42:40,967 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:42:40,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:42:40,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:42:40,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:42:40,969 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:42:40,970 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:42:40,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:42:40,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:42:40,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:42:40,971 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:42:40,971 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:42:40,972 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:42:40,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:42:40,972 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:42:40,973 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:42:40,973 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:42:40,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:42:40,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:42:40,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:42:40,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:42:40,974 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:42:40,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:42:40,975 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:42:40,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:42:40,976 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:42:40,976 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_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/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_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur 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 -> 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 [2022-11-25 22:42:41,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:42:41,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:42:41,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:42:41,341 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:42:41,341 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:42:41,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2022-11-25 22:42:44,556 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:42:45,024 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:42:45,025 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2022-11-25 22:42:45,046 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/data/15c7aeb0b/46126fedfcbe4a7bacda84eee64d7c42/FLAG761d6db93 [2022-11-25 22:42:45,062 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/data/15c7aeb0b/46126fedfcbe4a7bacda84eee64d7c42 [2022-11-25 22:42:45,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:42:45,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:42:45,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:42:45,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:42:45,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:42:45,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:42:45" (1/1) ... [2022-11-25 22:42:45,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258f83c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:45, skipping insertion in model container [2022-11-25 22:42:45,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:42:45" (1/1) ... [2022-11-25 22:42:45,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:42:45,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:42:45,724 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_b6e78b89-3255-43eb-ad50-680e7335c9e3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i[33022,33035] [2022-11-25 22:42:45,923 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:45,941 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:45,978 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:45,992 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:46,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:42:46,045 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-25 22:42:46,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@37abdc87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:46, skipping insertion in model container [2022-11-25 22:42:46,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:42:46,047 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-25 22:42:46,048 INFO L158 Benchmark]: Toolchain (without parser) took 978.09ms. Allocated memory is still 161.5MB. Free memory was 119.3MB in the beginning and 112.3MB in the end (delta: 7.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 22:42:46,049 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 111.1MB. Free memory was 82.8MB in the beginning and 82.7MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:42:46,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 973.36ms. Allocated memory is still 161.5MB. Free memory was 119.1MB in the beginning and 112.3MB in the end (delta: 6.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 22:42:46,051 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.26ms. Allocated memory is still 111.1MB. Free memory was 82.8MB in the beginning and 82.7MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 973.36ms. Allocated memory is still 161.5MB. Free memory was 119.1MB in the beginning and 112.3MB in the end (delta: 6.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: 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_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur --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 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 --- 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-38b53e6 [2022-11-25 22:42:48,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:42:48,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:42:48,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:42:48,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:42:48,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:42:48,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:42:48,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:42:48,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:42:48,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:42:48,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:42:48,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:42:48,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:42:48,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:42:48,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:42:48,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:42:48,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:42:48,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:42:48,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:42:48,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:42:48,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:42:48,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:42:48,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:42:48,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:42:48,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:42:48,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:42:48,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:42:48,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:42:48,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:42:48,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:42:48,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:42:48,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:42:48,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:42:48,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:42:48,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:42:48,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:42:48,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:42:48,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:42:48,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:42:48,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:42:48,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:42:48,535 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-25 22:42:48,578 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:42:48,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:42:48,579 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:42:48,579 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:42:48,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:42:48,581 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:42:48,581 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:42:48,581 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:42:48,581 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:42:48,582 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:42:48,583 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:42:48,583 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:42:48,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:42:48,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:42:48,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:42:48,585 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:42:48,585 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:42:48,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:42:48,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:42:48,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:42:48,586 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:42:48,586 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:42:48,587 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:42:48,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:42:48,587 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:42:48,588 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 22:42:48,588 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 22:42:48,588 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:42:48,588 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:42:48,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:42:48,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 22:42:48,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:42:48,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:42:48,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:42:48,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:42:48,591 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 22:42:48,591 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 22:42:48,591 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:42:48,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 22:42:48,592 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_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/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_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur 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 -> 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 [2022-11-25 22:42:49,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:42:49,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:42:49,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:42:49,060 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:42:49,061 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:42:49,062 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2022-11-25 22:42:52,155 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:42:52,539 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:42:52,539 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2022-11-25 22:42:52,570 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/data/4a2cbda3b/fbe340452a334bbdab7e4c9584e9e458/FLAG1b67538f2 [2022-11-25 22:42:52,589 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/data/4a2cbda3b/fbe340452a334bbdab7e4c9584e9e458 [2022-11-25 22:42:52,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:42:52,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:42:52,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:42:52,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:42:52,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:42:52,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:42:52" (1/1) ... [2022-11-25 22:42:52,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db32a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:52, skipping insertion in model container [2022-11-25 22:42:52,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:42:52" (1/1) ... [2022-11-25 22:42:52,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:42:52,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:42:53,200 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_b6e78b89-3255-43eb-ad50-680e7335c9e3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i[33022,33035] [2022-11-25 22:42:53,446 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:53,481 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:53,493 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:53,505 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:53,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:42:53,547 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 22:42:53,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:42:53,592 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_b6e78b89-3255-43eb-ad50-680e7335c9e3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i[33022,33035] [2022-11-25 22:42:53,669 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:53,703 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:53,725 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:53,744 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:53,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:42:53,779 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:42:53,818 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_b6e78b89-3255-43eb-ad50-680e7335c9e3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i[33022,33035] [2022-11-25 22:42:53,884 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:53,895 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:53,911 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:53,934 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:53,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:42:53,997 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:42:53,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:53 WrapperNode [2022-11-25 22:42:53,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:42:54,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:42:54,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:42:54,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:42:54,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:53" (1/1) ... [2022-11-25 22:42:54,069 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:53" (1/1) ... [2022-11-25 22:42:54,200 INFO L138 Inliner]: procedures = 180, calls = 623, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2483 [2022-11-25 22:42:54,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:42:54,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:42:54,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:42:54,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:42:54,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:53" (1/1) ... [2022-11-25 22:42:54,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:53" (1/1) ... [2022-11-25 22:42:54,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:53" (1/1) ... [2022-11-25 22:42:54,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:53" (1/1) ... [2022-11-25 22:42:54,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:53" (1/1) ... [2022-11-25 22:42:54,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:53" (1/1) ... [2022-11-25 22:42:54,354 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:53" (1/1) ... [2022-11-25 22:42:54,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:53" (1/1) ... [2022-11-25 22:42:54,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:42:54,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:42:54,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:42:54,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:42:54,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:53" (1/1) ... [2022-11-25 22:42:54,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:42:54,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:42:54,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:42:54,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:42:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-25 22:42:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2022-11-25 22:42:54,456 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2022-11-25 22:42:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 22:42:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 22:42:54,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 22:42:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-25 22:42:54,457 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-25 22:42:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 22:42:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:42:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 22:42:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:42:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-25 22:42:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 22:42:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:42:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 22:42:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 22:42:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:42:54,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:42:54,880 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:42:54,892 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:42:54,897 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 22:43:05,401 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:43:05,417 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:43:05,418 INFO L300 CfgBuilder]: Removed 168 assume(true) statements. [2022-11-25 22:43:05,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:43:05 BoogieIcfgContainer [2022-11-25 22:43:05,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:43:05,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:43:05,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:43:05,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:43:05,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:42:52" (1/3) ... [2022-11-25 22:43:05,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d84ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:43:05, skipping insertion in model container [2022-11-25 22:43:05,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:53" (2/3) ... [2022-11-25 22:43:05,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d84ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:43:05, skipping insertion in model container [2022-11-25 22:43:05,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:43:05" (3/3) ... [2022-11-25 22:43:05,432 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test10-3.i [2022-11-25 22:43:05,450 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:43:05,451 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1193 error locations. [2022-11-25 22:43:05,568 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:43:05,574 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;@3a2a5701, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:43:05,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1193 error locations. [2022-11-25 22:43:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 2435 states, 1230 states have (on average 2.2284552845528456) internal successors, (2741), 2421 states have internal predecessors, (2741), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-25 22:43:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 22:43:05,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:05,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 22:43:05,590 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:43:05,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:05,595 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2022-11-25 22:43:05,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:05,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776298762] [2022-11-25 22:43:05,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:05,607 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-25 22:43:05,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:05,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:05,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:05,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:43:05,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:05,936 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-25 22:43:05,974 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-25 22:43:05,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:05,975 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:05,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776298762] [2022-11-25 22:43:05,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776298762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:05,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:05,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:43:05,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603319803] [2022-11-25 22:43:05,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:05,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:43:05,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:06,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:43:06,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:43:06,033 INFO L87 Difference]: Start difference. First operand has 2435 states, 1230 states have (on average 2.2284552845528456) internal successors, (2741), 2421 states have internal predecessors, (2741), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 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-25 22:43:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:11,856 INFO L93 Difference]: Finished difference Result 3278 states and 3477 transitions. [2022-11-25 22:43:11,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:43:11,858 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-25 22:43:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:11,884 INFO L225 Difference]: With dead ends: 3278 [2022-11-25 22:43:11,885 INFO L226 Difference]: Without dead ends: 3276 [2022-11-25 22:43:11,886 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-25 22:43:11,890 INFO L413 NwaCegarLoop]: 1661 mSDtfsCounter, 2314 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2324 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:11,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2324 Valid, 2224 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-25 22:43:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2022-11-25 22:43:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 2577. [2022-11-25 22:43:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2577 states, 1396 states have (on average 2.067335243553009) internal successors, (2886), 2561 states have internal predecessors, (2886), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 22:43:12,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2577 states and 2918 transitions. [2022-11-25 22:43:12,042 INFO L78 Accepts]: Start accepts. Automaton has 2577 states and 2918 transitions. Word has length 3 [2022-11-25 22:43:12,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:12,043 INFO L495 AbstractCegarLoop]: Abstraction has 2577 states and 2918 transitions. [2022-11-25 22:43:12,043 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-25 22:43:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2577 states and 2918 transitions. [2022-11-25 22:43:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 22:43:12,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:12,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 22:43:12,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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)] Ended with exit code 0 [2022-11-25 22:43:12,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:12,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:43:12,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:12,257 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2022-11-25 22:43:12,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:12,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327635458] [2022-11-25 22:43:12,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:12,258 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-25 22:43:12,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:12,260 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:12,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:12,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:43:12,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:12,500 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-25 22:43:12,514 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-25 22:43:12,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:12,520 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:12,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327635458] [2022-11-25 22:43:12,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327635458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:12,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:12,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:43:12,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433989013] [2022-11-25 22:43:12,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:12,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:43:12,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:12,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:43:12,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:43:12,526 INFO L87 Difference]: Start difference. First operand 2577 states and 2918 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-25 22:43:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:20,719 INFO L93 Difference]: Finished difference Result 3725 states and 4166 transitions. [2022-11-25 22:43:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:43:20,721 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-25 22:43:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:20,733 INFO L225 Difference]: With dead ends: 3725 [2022-11-25 22:43:20,734 INFO L226 Difference]: Without dead ends: 3725 [2022-11-25 22:43:20,734 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-25 22:43:20,735 INFO L413 NwaCegarLoop]: 2041 mSDtfsCounter, 1240 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 3425 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:20,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 3425 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-11-25 22:43:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3725 states. [2022-11-25 22:43:20,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3725 to 3026. [2022-11-25 22:43:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3026 states, 1843 states have (on average 2.023331524688009) internal successors, (3729), 3007 states have internal predecessors, (3729), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-25 22:43:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 3767 transitions. [2022-11-25 22:43:20,812 INFO L78 Accepts]: Start accepts. Automaton has 3026 states and 3767 transitions. Word has length 3 [2022-11-25 22:43:20,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:20,813 INFO L495 AbstractCegarLoop]: Abstraction has 3026 states and 3767 transitions. [2022-11-25 22:43:20,813 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-25 22:43:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3026 states and 3767 transitions. [2022-11-25 22:43:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 22:43:20,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:20,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:20,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:21,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:21,033 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:43:21,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:21,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2022-11-25 22:43:21,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:21,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253229305] [2022-11-25 22:43:21,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:21,035 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-25 22:43:21,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:21,037 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:21,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:21,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:43:21,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:21,298 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-25 22:43:21,307 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-25 22:43:21,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:21,369 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-25 22:43:21,386 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:43:21,387 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-25 22:43:21,409 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-25 22:43:21,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:21,410 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:21,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253229305] [2022-11-25 22:43:21,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253229305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:21,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:21,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:43:21,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44699759] [2022-11-25 22:43:21,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:21,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:43:21,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:21,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:43:21,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:43:21,413 INFO L87 Difference]: Start difference. First operand 3026 states and 3767 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:37,226 INFO L93 Difference]: Finished difference Result 6002 states and 6929 transitions. [2022-11-25 22:43:37,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:43:37,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 22:43:37,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:37,246 INFO L225 Difference]: With dead ends: 6002 [2022-11-25 22:43:37,246 INFO L226 Difference]: Without dead ends: 6002 [2022-11-25 22:43:37,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:43:37,247 INFO L413 NwaCegarLoop]: 977 mSDtfsCounter, 3124 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 4719 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3134 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 4743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:37,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3134 Valid, 3150 Invalid, 4743 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 4719 Invalid, 0 Unknown, 0 Unchecked, 15.6s Time] [2022-11-25 22:43:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2022-11-25 22:43:37,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3743. [2022-11-25 22:43:37,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3743 states, 2560 states have (on average 2.0515625) internal successors, (5252), 3718 states have internal predecessors, (5252), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:43:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5302 transitions. [2022-11-25 22:43:37,348 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5302 transitions. Word has length 7 [2022-11-25 22:43:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:37,348 INFO L495 AbstractCegarLoop]: Abstraction has 3743 states and 5302 transitions. [2022-11-25 22:43:37,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5302 transitions. [2022-11-25 22:43:37,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 22:43:37,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:37,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:37,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:37,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:37,565 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:43:37,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:37,565 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2022-11-25 22:43:37,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:37,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554453691] [2022-11-25 22:43:37,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:37,567 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-25 22:43:37,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:37,568 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:37,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:37,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:43:37,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:37,806 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-25 22:43:37,822 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-25 22:43:37,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:37,827 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:37,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554453691] [2022-11-25 22:43:37,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554453691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:37,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:37,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:43:37,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058665860] [2022-11-25 22:43:37,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:37,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:43:37,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:37,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:43:37,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:43:37,837 INFO L87 Difference]: Start difference. First operand 3743 states and 5302 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:42,554 INFO L93 Difference]: Finished difference Result 4947 states and 6819 transitions. [2022-11-25 22:43:42,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:43:42,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 22:43:42,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:42,570 INFO L225 Difference]: With dead ends: 4947 [2022-11-25 22:43:42,570 INFO L226 Difference]: Without dead ends: 4947 [2022-11-25 22:43:42,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:43:42,571 INFO L413 NwaCegarLoop]: 2362 mSDtfsCounter, 1994 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 3208 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:42,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2004 Valid, 3208 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-25 22:43:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2022-11-25 22:43:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 3652. [2022-11-25 22:43:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3652 states, 2560 states have (on average 1.968359375) internal successors, (5039), 3627 states have internal predecessors, (5039), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:43:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 5089 transitions. [2022-11-25 22:43:42,657 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 5089 transitions. Word has length 8 [2022-11-25 22:43:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:42,657 INFO L495 AbstractCegarLoop]: Abstraction has 3652 states and 5089 transitions. [2022-11-25 22:43:42,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 5089 transitions. [2022-11-25 22:43:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 22:43:42,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:42,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:42,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:42,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:42,871 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:43:42,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:42,872 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2022-11-25 22:43:42,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:42,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035582645] [2022-11-25 22:43:42,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:42,873 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-25 22:43:42,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:42,874 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:42,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:43,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:43:43,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:43,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 5 [2022-11-25 22:43:43,149 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-25 22:43:43,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:43,150 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:43,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035582645] [2022-11-25 22:43:43,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035582645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:43,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:43,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:43:43,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113586822] [2022-11-25 22:43:43,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:43,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:43:43,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:43,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:43:43,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:43:43,153 INFO L87 Difference]: Start difference. First operand 3652 states and 5089 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:50,658 INFO L93 Difference]: Finished difference Result 5367 states and 7447 transitions. [2022-11-25 22:43:50,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:43:50,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 22:43:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:50,677 INFO L225 Difference]: With dead ends: 5367 [2022-11-25 22:43:50,677 INFO L226 Difference]: Without dead ends: 5367 [2022-11-25 22:43:50,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:43:50,678 INFO L413 NwaCegarLoop]: 2742 mSDtfsCounter, 1369 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:50,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 3923 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-11-25 22:43:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2022-11-25 22:43:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 3974. [2022-11-25 22:43:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3974 states, 2892 states have (on average 1.9540110650069156) internal successors, (5651), 3949 states have internal predecessors, (5651), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:43:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 5701 transitions. [2022-11-25 22:43:50,798 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 5701 transitions. Word has length 8 [2022-11-25 22:43:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:50,799 INFO L495 AbstractCegarLoop]: Abstraction has 3974 states and 5701 transitions. [2022-11-25 22:43:50,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 5701 transitions. [2022-11-25 22:43:50,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:43:50,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:50,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:50,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:51,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:51,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:43:51,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:51,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1045354379, now seen corresponding path program 1 times [2022-11-25 22:43:51,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:51,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716780002] [2022-11-25 22:43:51,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:51,013 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-25 22:43:51,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:51,014 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:51,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:51,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 22:43:51,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:43:51,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:51,234 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:51,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716780002] [2022-11-25 22:43:51,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716780002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:51,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:51,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:43:51,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322255892] [2022-11-25 22:43:51,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:51,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:43:51,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:51,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:43:51,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:43:51,236 INFO L87 Difference]: Start difference. First operand 3974 states and 5701 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:51,294 INFO L93 Difference]: Finished difference Result 3914 states and 5615 transitions. [2022-11-25 22:43:51,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:43:51,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 22:43:51,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:51,325 INFO L225 Difference]: With dead ends: 3914 [2022-11-25 22:43:51,325 INFO L226 Difference]: Without dead ends: 3914 [2022-11-25 22:43:51,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:43:51,326 INFO L413 NwaCegarLoop]: 2403 mSDtfsCounter, 1197 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 3615 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-25 22:43:51,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 3615 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:43:51,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2022-11-25 22:43:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3914. [2022-11-25 22:43:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3914 states, 2856 states have (on average 1.9485294117647058) internal successors, (5565), 3889 states have internal predecessors, (5565), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:43:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3914 states to 3914 states and 5615 transitions. [2022-11-25 22:43:51,407 INFO L78 Accepts]: Start accepts. Automaton has 3914 states and 5615 transitions. Word has length 11 [2022-11-25 22:43:51,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:51,408 INFO L495 AbstractCegarLoop]: Abstraction has 3914 states and 5615 transitions. [2022-11-25 22:43:51,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3914 states and 5615 transitions. [2022-11-25 22:43:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 22:43:51,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:51,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:51,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:51,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:51,621 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:43:51,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash 436842575, now seen corresponding path program 1 times [2022-11-25 22:43:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:51,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104694975] [2022-11-25 22:43:51,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:51,623 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-25 22:43:51,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:51,624 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:51,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:51,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:43:51,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:51,895 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-25 22:43:51,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:51,895 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:51,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104694975] [2022-11-25 22:43:51,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104694975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:51,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:51,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:43:51,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462097876] [2022-11-25 22:43:51,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:51,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:43:51,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:51,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:43:51,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:43:51,898 INFO L87 Difference]: Start difference. First operand 3914 states and 5615 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:52,018 INFO L93 Difference]: Finished difference Result 3886 states and 5559 transitions. [2022-11-25 22:43:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:43:52,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 22:43:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:52,028 INFO L225 Difference]: With dead ends: 3886 [2022-11-25 22:43:52,028 INFO L226 Difference]: Without dead ends: 3886 [2022-11-25 22:43:52,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:43:52,030 INFO L413 NwaCegarLoop]: 2358 mSDtfsCounter, 1178 mSDsluCounter, 3563 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 5921 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-25 22:43:52,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 5921 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:43:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2022-11-25 22:43:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3884. [2022-11-25 22:43:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3884 states, 2840 states have (on average 1.9390845070422535) internal successors, (5507), 3859 states have internal predecessors, (5507), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:43:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3884 states and 5557 transitions. [2022-11-25 22:43:52,148 INFO L78 Accepts]: Start accepts. Automaton has 3884 states and 5557 transitions. Word has length 13 [2022-11-25 22:43:52,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:52,149 INFO L495 AbstractCegarLoop]: Abstraction has 3884 states and 5557 transitions. [2022-11-25 22:43:52,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:52,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 5557 transitions. [2022-11-25 22:43:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 22:43:52,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:52,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:52,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:52,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:52,363 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:43:52,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:52,363 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2022-11-25 22:43:52,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:52,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011320447] [2022-11-25 22:43:52,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:52,364 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-25 22:43:52,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:52,366 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:52,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:52,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 22:43:52,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:52,649 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-25 22:43:52,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:52,650 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:52,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011320447] [2022-11-25 22:43:52,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011320447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:52,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:52,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:43:52,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918592002] [2022-11-25 22:43:52,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:52,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:43:52,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:52,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:43:52,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:43:52,651 INFO L87 Difference]: Start difference. First operand 3884 states and 5557 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:52,718 INFO L93 Difference]: Finished difference Result 5509 states and 7308 transitions. [2022-11-25 22:43:52,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:43:52,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 22:43:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:52,730 INFO L225 Difference]: With dead ends: 5509 [2022-11-25 22:43:52,730 INFO L226 Difference]: Without dead ends: 5509 [2022-11-25 22:43:52,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-25 22:43:52,731 INFO L413 NwaCegarLoop]: 3864 mSDtfsCounter, 2284 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 5664 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-25 22:43:52,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2294 Valid, 5664 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:43:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2022-11-25 22:43:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 3824. [2022-11-25 22:43:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 2804 states have (on average 1.9333095577746078) internal successors, (5421), 3799 states have internal predecessors, (5421), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:43:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 5471 transitions. [2022-11-25 22:43:52,803 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 5471 transitions. Word has length 20 [2022-11-25 22:43:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:52,803 INFO L495 AbstractCegarLoop]: Abstraction has 3824 states and 5471 transitions. [2022-11-25 22:43:52,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 5471 transitions. [2022-11-25 22:43:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 22:43:52,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:52,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:52,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:53,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:53,017 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:43:53,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:53,018 INFO L85 PathProgramCache]: Analyzing trace with hash 413623007, now seen corresponding path program 1 times [2022-11-25 22:43:53,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:53,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451350858] [2022-11-25 22:43:53,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:53,018 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-25 22:43:53,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:53,020 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:53,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:53,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 22:43:53,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:53,332 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-25 22:43:53,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:53,333 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:53,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451350858] [2022-11-25 22:43:53,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451350858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:53,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:53,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:43:53,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540936307] [2022-11-25 22:43:53,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:53,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:43:53,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:53,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:43:53,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:43:53,338 INFO L87 Difference]: Start difference. First operand 3824 states and 5471 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:53,415 INFO L93 Difference]: Finished difference Result 5342 states and 7017 transitions. [2022-11-25 22:43:53,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:43:53,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 22:43:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:53,427 INFO L225 Difference]: With dead ends: 5342 [2022-11-25 22:43:53,427 INFO L226 Difference]: Without dead ends: 5342 [2022-11-25 22:43:53,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-25 22:43:53,430 INFO L413 NwaCegarLoop]: 3774 mSDtfsCounter, 2241 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2251 SdHoareTripleChecker+Valid, 5526 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-25 22:43:53,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2251 Valid, 5526 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:43:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5342 states. [2022-11-25 22:43:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5342 to 3692. [2022-11-25 22:43:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 2696 states have (on average 1.915059347181009) internal successors, (5163), 3667 states have internal predecessors, (5163), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:43:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 5213 transitions. [2022-11-25 22:43:53,495 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 5213 transitions. Word has length 20 [2022-11-25 22:43:53,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:53,495 INFO L495 AbstractCegarLoop]: Abstraction has 3692 states and 5213 transitions. [2022-11-25 22:43:53,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:53,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 5213 transitions. [2022-11-25 22:43:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 22:43:53,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:53,498 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] [2022-11-25 22:43:53,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:53,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:53,710 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:43:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:53,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2022-11-25 22:43:53,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:53,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373851412] [2022-11-25 22:43:53,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:53,719 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-25 22:43:53,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:53,723 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:53,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:53,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:43:53,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:53,994 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-25 22:43:53,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:53,995 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:53,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373851412] [2022-11-25 22:43:53,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373851412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:53,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:53,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:43:53,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163633599] [2022-11-25 22:43:53,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:53,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:43:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:53,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:43:53,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:43:53,997 INFO L87 Difference]: Start difference. First operand 3692 states and 5213 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-25 22:43:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:54,138 INFO L93 Difference]: Finished difference Result 5307 states and 6951 transitions. [2022-11-25 22:43:54,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:43:54,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-11-25 22:43:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:54,150 INFO L225 Difference]: With dead ends: 5307 [2022-11-25 22:43:54,150 INFO L226 Difference]: Without dead ends: 5307 [2022-11-25 22:43:54,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-25 22:43:54,152 INFO L413 NwaCegarLoop]: 3954 mSDtfsCounter, 2222 mSDsluCounter, 5704 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2232 SdHoareTripleChecker+Valid, 9658 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-25 22:43:54,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2232 Valid, 9658 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:43:54,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5307 states. [2022-11-25 22:43:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5307 to 3662. [2022-11-25 22:43:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 2680 states have (on average 1.9048507462686568) internal successors, (5105), 3637 states have internal predecessors, (5105), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:43:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 5155 transitions. [2022-11-25 22:43:54,276 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 5155 transitions. Word has length 22 [2022-11-25 22:43:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:54,277 INFO L495 AbstractCegarLoop]: Abstraction has 3662 states and 5155 transitions. [2022-11-25 22:43:54,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-25 22:43:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 5155 transitions. [2022-11-25 22:43:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 22:43:54,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:54,282 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] [2022-11-25 22:43:54,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:54,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:54,508 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr358REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:43:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:54,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1940223495, now seen corresponding path program 1 times [2022-11-25 22:43:54,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:54,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654753783] [2022-11-25 22:43:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:54,510 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-25 22:43:54,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:54,511 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:54,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:54,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:43:54,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:43:54,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:54,835 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:54,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654753783] [2022-11-25 22:43:54,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654753783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:54,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:54,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:43:54,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990715681] [2022-11-25 22:43:54,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:54,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:43:54,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:54,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:43:54,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:43:54,836 INFO L87 Difference]: Start difference. First operand 3662 states and 5155 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-25 22:43:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:54,945 INFO L93 Difference]: Finished difference Result 5234 states and 6762 transitions. [2022-11-25 22:43:54,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:43:54,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-11-25 22:43:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:54,957 INFO L225 Difference]: With dead ends: 5234 [2022-11-25 22:43:54,957 INFO L226 Difference]: Without dead ends: 5234 [2022-11-25 22:43:54,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-25 22:43:54,958 INFO L413 NwaCegarLoop]: 3879 mSDtfsCounter, 2187 mSDsluCounter, 5589 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2197 SdHoareTripleChecker+Valid, 9468 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-25 22:43:54,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2197 Valid, 9468 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:43:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2022-11-25 22:43:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 3600. [2022-11-25 22:43:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3600 states, 2632 states have (on average 1.8734802431610942) internal successors, (4931), 3575 states have internal predecessors, (4931), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:43:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 4981 transitions. [2022-11-25 22:43:55,017 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 4981 transitions. Word has length 22 [2022-11-25 22:43:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:55,017 INFO L495 AbstractCegarLoop]: Abstraction has 3600 states and 4981 transitions. [2022-11-25 22:43:55,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-25 22:43:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4981 transitions. [2022-11-25 22:43:55,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 22:43:55,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:55,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:55,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:55,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:55,231 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:43:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:55,232 INFO L85 PathProgramCache]: Analyzing trace with hash 558613821, now seen corresponding path program 1 times [2022-11-25 22:43:55,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:55,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545976297] [2022-11-25 22:43:55,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:55,232 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-25 22:43:55,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:55,234 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:55,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:43:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:55,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:43:55,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:55,484 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-25 22:43:55,579 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-25 22:43:55,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:55,580 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:55,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545976297] [2022-11-25 22:43:55,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545976297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:55,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:55,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:43:55,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817405585] [2022-11-25 22:43:55,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:55,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:43:55,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:55,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:43:55,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:43:55,582 INFO L87 Difference]: Start difference. First operand 3600 states and 4981 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:44:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:01,041 INFO L93 Difference]: Finished difference Result 4220 states and 5515 transitions. [2022-11-25 22:44:01,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:44:01,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 22:44:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:01,049 INFO L225 Difference]: With dead ends: 4220 [2022-11-25 22:44:01,050 INFO L226 Difference]: Without dead ends: 4220 [2022-11-25 22:44:01,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:44:01,051 INFO L413 NwaCegarLoop]: 1511 mSDtfsCounter, 3093 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3099 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:01,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3099 Valid, 2783 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-25 22:44:01,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2022-11-25 22:44:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 3596. [2022-11-25 22:44:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3596 states, 2632 states have (on average 1.8704407294832828) internal successors, (4923), 3571 states have internal predecessors, (4923), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:44:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 4973 transitions. [2022-11-25 22:44:01,105 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 4973 transitions. Word has length 27 [2022-11-25 22:44:01,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:01,105 INFO L495 AbstractCegarLoop]: Abstraction has 3596 states and 4973 transitions. [2022-11-25 22:44:01,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:44:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 4973 transitions. [2022-11-25 22:44:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 22:44:01,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:01,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:44:01,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:01,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:01,318 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:44:01,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:01,318 INFO L85 PathProgramCache]: Analyzing trace with hash 558613822, now seen corresponding path program 1 times [2022-11-25 22:44:01,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:44:01,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415786743] [2022-11-25 22:44:01,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:01,319 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-25 22:44:01,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:44:01,321 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:01,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:01,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:44:01,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:01,624 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-25 22:44:01,886 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-25 22:44:01,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:44:01,886 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:44:01,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415786743] [2022-11-25 22:44:01,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415786743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:01,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:01,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:44:01,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054414295] [2022-11-25 22:44:01,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:01,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:44:01,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:01,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:44:01,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:44:01,888 INFO L87 Difference]: Start difference. First operand 3596 states and 4973 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:44:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:10,649 INFO L93 Difference]: Finished difference Result 4675 states and 6143 transitions. [2022-11-25 22:44:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:44:10,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 22:44:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:10,660 INFO L225 Difference]: With dead ends: 4675 [2022-11-25 22:44:10,660 INFO L226 Difference]: Without dead ends: 4675 [2022-11-25 22:44:10,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:44:10,661 INFO L413 NwaCegarLoop]: 1744 mSDtfsCounter, 2280 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2280 SdHoareTripleChecker+Valid, 4087 SdHoareTripleChecker+Invalid, 2586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:10,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2280 Valid, 4087 Invalid, 2586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-11-25 22:44:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4675 states. [2022-11-25 22:44:10,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4675 to 3632. [2022-11-25 22:44:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3632 states, 2668 states have (on average 1.8605697151424287) internal successors, (4964), 3607 states have internal predecessors, (4964), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:44:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 5014 transitions. [2022-11-25 22:44:10,718 INFO L78 Accepts]: Start accepts. Automaton has 3632 states and 5014 transitions. Word has length 27 [2022-11-25 22:44:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:10,718 INFO L495 AbstractCegarLoop]: Abstraction has 3632 states and 5014 transitions. [2022-11-25 22:44:10,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:44:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 5014 transitions. [2022-11-25 22:44:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 22:44:10,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:10,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] [2022-11-25 22:44:10,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:10,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:10,932 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:44:10,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:10,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2022-11-25 22:44:10,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:44:10,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044778744] [2022-11-25 22:44:10,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:10,935 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-25 22:44:10,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:44:10,936 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:10,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:11,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:44:11,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:11,267 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-25 22:44:11,360 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-25 22:44:11,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:44:11,361 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:44:11,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044778744] [2022-11-25 22:44:11,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044778744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:11,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:11,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:44:11,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168849508] [2022-11-25 22:44:11,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:11,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:44:11,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:11,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:44:11,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:44:11,364 INFO L87 Difference]: Start difference. First operand 3632 states and 5014 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-25 22:44:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:19,151 INFO L93 Difference]: Finished difference Result 7027 states and 9544 transitions. [2022-11-25 22:44:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:44:19,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-25 22:44:19,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:19,163 INFO L225 Difference]: With dead ends: 7027 [2022-11-25 22:44:19,163 INFO L226 Difference]: Without dead ends: 7027 [2022-11-25 22:44:19,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-25 22:44:19,164 INFO L413 NwaCegarLoop]: 2706 mSDtfsCounter, 4281 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 3162 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4288 SdHoareTripleChecker+Valid, 5103 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:19,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4288 Valid, 5103 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3162 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-11-25 22:44:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7027 states. [2022-11-25 22:44:19,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7027 to 3628. [2022-11-25 22:44:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3628 states, 2668 states have (on average 1.8575712143928036) internal successors, (4956), 3603 states have internal predecessors, (4956), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:44:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 5006 transitions. [2022-11-25 22:44:19,228 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 5006 transitions. Word has length 36 [2022-11-25 22:44:19,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:19,229 INFO L495 AbstractCegarLoop]: Abstraction has 3628 states and 5006 transitions. [2022-11-25 22:44:19,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-25 22:44:19,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 5006 transitions. [2022-11-25 22:44:19,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 22:44:19,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:19,230 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] [2022-11-25 22:44:19,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:19,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:19,443 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:44:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:19,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2022-11-25 22:44:19,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:44:19,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960700941] [2022-11-25 22:44:19,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:19,445 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-25 22:44:19,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:44:19,446 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:19,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:19,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:44:19,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:19,772 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-25 22:44:19,991 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-25 22:44:19,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:44:19,992 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:44:19,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960700941] [2022-11-25 22:44:19,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960700941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:19,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:19,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:44:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242319821] [2022-11-25 22:44:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:19,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:44:19,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:19,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:44:19,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:44:19,993 INFO L87 Difference]: Start difference. First operand 3628 states and 5006 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-25 22:44:31,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:31,747 INFO L93 Difference]: Finished difference Result 6721 states and 8949 transitions. [2022-11-25 22:44:31,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:44:31,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-25 22:44:31,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:31,758 INFO L225 Difference]: With dead ends: 6721 [2022-11-25 22:44:31,758 INFO L226 Difference]: Without dead ends: 6721 [2022-11-25 22:44:31,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-25 22:44:31,759 INFO L413 NwaCegarLoop]: 3191 mSDtfsCounter, 2831 mSDsluCounter, 2888 mSDsCounter, 0 mSdLazyCounter, 3485 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2835 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 3497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:31,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2835 Valid, 6079 Invalid, 3497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3485 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2022-11-25 22:44:31,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6721 states. [2022-11-25 22:44:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6721 to 3624. [2022-11-25 22:44:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 2668 states have (on average 1.8545727136431784) internal successors, (4948), 3599 states have internal predecessors, (4948), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:44:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 4998 transitions. [2022-11-25 22:44:31,823 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 4998 transitions. Word has length 36 [2022-11-25 22:44:31,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:31,824 INFO L495 AbstractCegarLoop]: Abstraction has 3624 states and 4998 transitions. [2022-11-25 22:44:31,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-25 22:44:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 4998 transitions. [2022-11-25 22:44:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 22:44:31,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:31,825 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] [2022-11-25 22:44:31,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:32,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:32,038 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:44:32,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash -775407193, now seen corresponding path program 1 times [2022-11-25 22:44:32,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:44:32,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845597676] [2022-11-25 22:44:32,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:32,039 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-25 22:44:32,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:44:32,041 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:32,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:32,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:44:32,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:32,365 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-25 22:44:32,458 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-25 22:44:32,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:44:32,458 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:44:32,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845597676] [2022-11-25 22:44:32,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845597676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:32,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:32,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:44:32,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485506065] [2022-11-25 22:44:32,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:32,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:44:32,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:32,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:44:32,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:44:32,461 INFO L87 Difference]: Start difference. First operand 3624 states and 4998 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-25 22:44:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:41,142 INFO L93 Difference]: Finished difference Result 7470 states and 10054 transitions. [2022-11-25 22:44:41,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:44:41,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-25 22:44:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:41,153 INFO L225 Difference]: With dead ends: 7470 [2022-11-25 22:44:41,153 INFO L226 Difference]: Without dead ends: 7470 [2022-11-25 22:44:41,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-25 22:44:41,154 INFO L413 NwaCegarLoop]: 2536 mSDtfsCounter, 4851 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4861 SdHoareTripleChecker+Valid, 5123 SdHoareTripleChecker+Invalid, 3393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:41,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4861 Valid, 5123 Invalid, 3393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3342 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-11-25 22:44:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2022-11-25 22:44:41,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 3621. [2022-11-25 22:44:41,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 2668 states have (on average 1.8463268365817092) internal successors, (4926), 3596 states have internal predecessors, (4926), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:44:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 4976 transitions. [2022-11-25 22:44:41,220 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 4976 transitions. Word has length 36 [2022-11-25 22:44:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:41,221 INFO L495 AbstractCegarLoop]: Abstraction has 3621 states and 4976 transitions. [2022-11-25 22:44:41,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-25 22:44:41,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 4976 transitions. [2022-11-25 22:44:41,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 22:44:41,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:41,222 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] [2022-11-25 22:44:41,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:41,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:41,435 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:44:41,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:41,435 INFO L85 PathProgramCache]: Analyzing trace with hash -775407192, now seen corresponding path program 1 times [2022-11-25 22:44:41,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:44:41,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652430439] [2022-11-25 22:44:41,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:41,436 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-25 22:44:41,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:44:41,437 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:41,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:41,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:44:41,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:41,781 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-25 22:44:41,981 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-25 22:44:41,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:44:41,982 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:44:41,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652430439] [2022-11-25 22:44:41,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652430439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:41,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:41,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:44:41,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628078304] [2022-11-25 22:44:41,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:41,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:44:41,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:41,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:44:41,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:44:41,983 INFO L87 Difference]: Start difference. First operand 3621 states and 4976 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-25 22:44:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:52,056 INFO L93 Difference]: Finished difference Result 5557 states and 7335 transitions. [2022-11-25 22:44:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:44:52,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-25 22:44:52,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:52,064 INFO L225 Difference]: With dead ends: 5557 [2022-11-25 22:44:52,064 INFO L226 Difference]: Without dead ends: 5557 [2022-11-25 22:44:52,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-25 22:44:52,065 INFO L413 NwaCegarLoop]: 2836 mSDtfsCounter, 2602 mSDsluCounter, 2461 mSDsCounter, 0 mSdLazyCounter, 2991 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2602 SdHoareTripleChecker+Valid, 5297 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:52,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2602 Valid, 5297 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2991 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-11-25 22:44:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2022-11-25 22:44:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 3621. [2022-11-25 22:44:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 2668 states have (on average 1.843328335832084) internal successors, (4918), 3596 states have internal predecessors, (4918), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:44:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 4968 transitions. [2022-11-25 22:44:52,121 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 4968 transitions. Word has length 36 [2022-11-25 22:44:52,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:52,121 INFO L495 AbstractCegarLoop]: Abstraction has 3621 states and 4968 transitions. [2022-11-25 22:44:52,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-25 22:44:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 4968 transitions. [2022-11-25 22:44:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 22:44:52,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:52,123 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] [2022-11-25 22:44:52,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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)] Ended with exit code 0 [2022-11-25 22:44:52,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:52,336 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:44:52,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:52,336 INFO L85 PathProgramCache]: Analyzing trace with hash -715750141, now seen corresponding path program 1 times [2022-11-25 22:44:52,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:44:52,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015788317] [2022-11-25 22:44:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:52,337 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-25 22:44:52,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:44:52,338 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:52,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:52,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:44:52,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:52,686 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-25 22:44:52,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:44:52,687 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:44:52,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015788317] [2022-11-25 22:44:52,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015788317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:52,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:52,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:44:52,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564517193] [2022-11-25 22:44:52,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:52,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:44:52,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:52,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:44:52,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:44:52,691 INFO L87 Difference]: Start difference. First operand 3621 states and 4968 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-25 22:44:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:52,796 INFO L93 Difference]: Finished difference Result 3609 states and 4944 transitions. [2022-11-25 22:44:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:44:52,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2022-11-25 22:44:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:52,802 INFO L225 Difference]: With dead ends: 3609 [2022-11-25 22:44:52,802 INFO L226 Difference]: Without dead ends: 3609 [2022-11-25 22:44:52,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-25 22:44:52,803 INFO L413 NwaCegarLoop]: 2189 mSDtfsCounter, 1155 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 5402 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:52,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 5402 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:44:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2022-11-25 22:44:52,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 3609. [2022-11-25 22:44:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3609 states, 2656 states have (on average 1.8426204819277108) internal successors, (4894), 3584 states have internal predecessors, (4894), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 22:44:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 4944 transitions. [2022-11-25 22:44:52,854 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 4944 transitions. Word has length 40 [2022-11-25 22:44:52,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:52,855 INFO L495 AbstractCegarLoop]: Abstraction has 3609 states and 4944 transitions. [2022-11-25 22:44:52,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-25 22:44:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 4944 transitions. [2022-11-25 22:44:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 22:44:52,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:52,856 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] [2022-11-25 22:44:52,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:53,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:53,069 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:44:53,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:53,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1005839671, now seen corresponding path program 1 times [2022-11-25 22:44:53,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:44:53,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052558168] [2022-11-25 22:44:53,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:53,070 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-25 22:44:53,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:44:53,071 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:53,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:53,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:44:53,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:53,639 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-25 22:44:53,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:44:53,639 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:44:53,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052558168] [2022-11-25 22:44:53,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052558168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:53,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:53,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:44:53,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498032840] [2022-11-25 22:44:53,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:53,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:44:53,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:53,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:44:53,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:44:53,641 INFO L87 Difference]: Start difference. First operand 3609 states and 4944 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-25 22:44:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:54,016 INFO L93 Difference]: Finished difference Result 5428 states and 7151 transitions. [2022-11-25 22:44:54,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:44:54,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2022-11-25 22:44:54,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:54,023 INFO L225 Difference]: With dead ends: 5428 [2022-11-25 22:44:54,023 INFO L226 Difference]: Without dead ends: 5428 [2022-11-25 22:44:54,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-25 22:44:54,023 INFO L413 NwaCegarLoop]: 2277 mSDtfsCounter, 1566 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:54,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1575 Valid, 4312 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:44:54,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5428 states. [2022-11-25 22:44:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5428 to 4625. [2022-11-25 22:44:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4625 states, 3665 states have (on average 1.8256480218281037) internal successors, (6691), 4590 states have internal predecessors, (6691), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-25 22:44:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 6761 transitions. [2022-11-25 22:44:54,103 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 6761 transitions. Word has length 48 [2022-11-25 22:44:54,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:54,104 INFO L495 AbstractCegarLoop]: Abstraction has 4625 states and 6761 transitions. [2022-11-25 22:44:54,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-25 22:44:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 6761 transitions. [2022-11-25 22:44:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 22:44:54,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:54,106 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] [2022-11-25 22:44:54,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:54,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:54,319 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:44:54,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:54,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1815084135, now seen corresponding path program 1 times [2022-11-25 22:44:54,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:44:54,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361107114] [2022-11-25 22:44:54,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:54,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-25 22:44:54,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:44:54,321 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:54,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:54,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:44:54,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:54,752 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-25 22:44:54,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:44:54,752 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:44:54,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361107114] [2022-11-25 22:44:54,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361107114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:54,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:54,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:44:54,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159122677] [2022-11-25 22:44:54,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:54,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:44:54,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:54,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:44:54,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:44:54,755 INFO L87 Difference]: Start difference. First operand 4625 states and 6761 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-25 22:44:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:54,866 INFO L93 Difference]: Finished difference Result 5936 states and 8133 transitions. [2022-11-25 22:44:54,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:44:54,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2022-11-25 22:44:54,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:54,876 INFO L225 Difference]: With dead ends: 5936 [2022-11-25 22:44:54,876 INFO L226 Difference]: Without dead ends: 5936 [2022-11-25 22:44:54,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-25 22:44:54,878 INFO L413 NwaCegarLoop]: 3648 mSDtfsCounter, 2150 mSDsluCounter, 5129 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 8777 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-25 22:44:54,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 8777 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:44:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5936 states. [2022-11-25 22:44:54,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5936 to 4583. [2022-11-25 22:44:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4583 states, 3623 states have (on average 1.8274910295335358) internal successors, (6621), 4548 states have internal predecessors, (6621), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-25 22:44:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 6691 transitions. [2022-11-25 22:44:55,002 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 6691 transitions. Word has length 51 [2022-11-25 22:44:55,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:55,003 INFO L495 AbstractCegarLoop]: Abstraction has 4583 states and 6691 transitions. [2022-11-25 22:44:55,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-25 22:44:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 6691 transitions. [2022-11-25 22:44:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 22:44:55,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:55,004 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-25 22:44:55,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:55,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:55,218 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:44:55,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2022-11-25 22:44:55,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:44:55,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120248864] [2022-11-25 22:44:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:55,220 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-25 22:44:55,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:44:55,221 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:55,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:55,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:44:55,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:55,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-25 22:44:55,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:44:55,682 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:44:55,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120248864] [2022-11-25 22:44:55,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120248864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:55,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:55,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:44:55,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780888427] [2022-11-25 22:44:55,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:55,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:44:55,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:55,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:44:55,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:44:55,686 INFO L87 Difference]: Start difference. First operand 4583 states and 6691 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-25 22:44:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:55,790 INFO L93 Difference]: Finished difference Result 5673 states and 7621 transitions. [2022-11-25 22:44:55,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:44:55,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2022-11-25 22:44:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:55,799 INFO L225 Difference]: With dead ends: 5673 [2022-11-25 22:44:55,799 INFO L226 Difference]: Without dead ends: 5673 [2022-11-25 22:44:55,800 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-25 22:44:55,800 INFO L413 NwaCegarLoop]: 3688 mSDtfsCounter, 2141 mSDsluCounter, 5218 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2151 SdHoareTripleChecker+Valid, 8906 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-25 22:44:55,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2151 Valid, 8906 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:44:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2022-11-25 22:44:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 4565. [2022-11-25 22:44:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4565 states, 3605 states have (on average 1.8282940360610263) internal successors, (6591), 4530 states have internal predecessors, (6591), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-25 22:44:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 6661 transitions. [2022-11-25 22:44:55,915 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 6661 transitions. Word has length 54 [2022-11-25 22:44:55,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:55,916 INFO L495 AbstractCegarLoop]: Abstraction has 4565 states and 6661 transitions. [2022-11-25 22:44:55,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-25 22:44:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 6661 transitions. [2022-11-25 22:44:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 22:44:55,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:55,917 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] [2022-11-25 22:44:55,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:56,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:56,127 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:44:56,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:56,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1638755906, now seen corresponding path program 1 times [2022-11-25 22:44:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:44:56,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597190079] [2022-11-25 22:44:56,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:56,128 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-25 22:44:56,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:44:56,130 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:56,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:44:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:56,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 22:44:56,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:56,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:56,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:56,554 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 29 treesize of output 38 [2022-11-25 22:44:56,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:56,606 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 62 treesize of output 22 [2022-11-25 22:44:56,649 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-25 22:44:56,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:44:56,649 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:44:56,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597190079] [2022-11-25 22:44:56,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597190079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:56,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:56,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:44:56,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137358501] [2022-11-25 22:44:56,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:56,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:44:56,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:56,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:44:56,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:44:56,652 INFO L87 Difference]: Start difference. First operand 4565 states and 6661 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 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-25 22:44:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:59,729 INFO L93 Difference]: Finished difference Result 4795 states and 6902 transitions. [2022-11-25 22:44:59,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:44:59,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 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 57 [2022-11-25 22:44:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:59,736 INFO L225 Difference]: With dead ends: 4795 [2022-11-25 22:44:59,736 INFO L226 Difference]: Without dead ends: 4795 [2022-11-25 22:44:59,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-25 22:44:59,737 INFO L413 NwaCegarLoop]: 2065 mSDtfsCounter, 1034 mSDsluCounter, 3289 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 5354 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:59,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 5354 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-25 22:44:59,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2022-11-25 22:44:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 4531. [2022-11-25 22:44:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4531 states, 3571 states have (on average 1.8359003080369645) internal successors, (6556), 4496 states have internal predecessors, (6556), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-25 22:44:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6626 transitions. [2022-11-25 22:44:59,793 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6626 transitions. Word has length 57 [2022-11-25 22:44:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:59,794 INFO L495 AbstractCegarLoop]: Abstraction has 4531 states and 6626 transitions. [2022-11-25 22:44:59,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 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-25 22:44:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6626 transitions. [2022-11-25 22:44:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-25 22:44:59,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:59,795 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] [2022-11-25 22:44:59,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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)] Ended with exit code 0 [2022-11-25 22:45:00,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:00,008 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:45:00,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:00,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2076762779, now seen corresponding path program 1 times [2022-11-25 22:45:00,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:45:00,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453011993] [2022-11-25 22:45:00,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:00,009 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-25 22:45:00,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:45:00,010 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:00,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-25 22:45:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:00,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:45:00,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:00,680 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-25 22:45:00,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:45:00,681 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:45:00,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453011993] [2022-11-25 22:45:00,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453011993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:45:00,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:45:00,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:45:00,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961670483] [2022-11-25 22:45:00,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:45:00,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:45:00,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:45:00,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:45:00,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:45:00,682 INFO L87 Difference]: Start difference. First operand 4531 states and 6626 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-25 22:45:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:00,917 INFO L93 Difference]: Finished difference Result 6332 states and 8900 transitions. [2022-11-25 22:45:00,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:45:00,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2022-11-25 22:45:00,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:00,925 INFO L225 Difference]: With dead ends: 6332 [2022-11-25 22:45:00,925 INFO L226 Difference]: Without dead ends: 6332 [2022-11-25 22:45:00,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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-25 22:45:00,926 INFO L413 NwaCegarLoop]: 2340 mSDtfsCounter, 1264 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 4405 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:00,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 4405 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:45:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6332 states. [2022-11-25 22:45:00,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6332 to 5603. [2022-11-25 22:45:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5603 states, 4635 states have (on average 1.8101402373247033) internal successors, (8390), 5557 states have internal predecessors, (8390), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 22:45:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5603 states to 5603 states and 8482 transitions. [2022-11-25 22:45:01,070 INFO L78 Accepts]: Start accepts. Automaton has 5603 states and 8482 transitions. Word has length 59 [2022-11-25 22:45:01,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:01,071 INFO L495 AbstractCegarLoop]: Abstraction has 5603 states and 8482 transitions. [2022-11-25 22:45:01,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-25 22:45:01,071 INFO L276 IsEmpty]: Start isEmpty. Operand 5603 states and 8482 transitions. [2022-11-25 22:45:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-25 22:45:01,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:01,071 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-25 22:45:01,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:01,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:01,272 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:45:01,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:01,273 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2022-11-25 22:45:01,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:45:01,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645259458] [2022-11-25 22:45:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:01,273 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-25 22:45:01,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:45:01,275 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:01,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-25 22:45:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:01,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:45:01,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:01,770 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-25 22:45:01,777 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-25 22:45:02,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:02,355 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-25 22:45:02,372 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:45:02,373 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-25 22:45:02,389 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-25 22:45:02,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:45:02,389 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:45:02,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645259458] [2022-11-25 22:45:02,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645259458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:45:02,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:45:02,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:45:02,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092122095] [2022-11-25 22:45:02,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:45:02,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:45:02,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:45:02,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:45:02,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:45:02,392 INFO L87 Difference]: Start difference. First operand 5603 states and 8482 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-25 22:45:09,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:09,300 INFO L93 Difference]: Finished difference Result 8022 states and 12205 transitions. [2022-11-25 22:45:09,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:45:09,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-11-25 22:45:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:09,309 INFO L225 Difference]: With dead ends: 8022 [2022-11-25 22:45:09,309 INFO L226 Difference]: Without dead ends: 8022 [2022-11-25 22:45:09,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-25 22:45:09,310 INFO L413 NwaCegarLoop]: 1035 mSDtfsCounter, 4008 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4022 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:09,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4022 Valid, 1639 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-11-25 22:45:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8022 states. [2022-11-25 22:45:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8022 to 5363. [2022-11-25 22:45:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5363 states, 4479 states have (on average 1.7434695244474212) internal successors, (7809), 5317 states have internal predecessors, (7809), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 22:45:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5363 states to 5363 states and 7901 transitions. [2022-11-25 22:45:09,372 INFO L78 Accepts]: Start accepts. Automaton has 5363 states and 7901 transitions. Word has length 62 [2022-11-25 22:45:09,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:09,372 INFO L495 AbstractCegarLoop]: Abstraction has 5363 states and 7901 transitions. [2022-11-25 22:45:09,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-25 22:45:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 5363 states and 7901 transitions. [2022-11-25 22:45:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 22:45:09,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:09,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:45:09,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:09,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:09,575 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:45:09,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2022-11-25 22:45:09,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:45:09,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003708319] [2022-11-25 22:45:09,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:09,576 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-25 22:45:09,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:45:09,577 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:09,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:09,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 22:45:09,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:09,989 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-25 22:45:10,003 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-25 22:45:10,043 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-25 22:45:10,055 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-25 22:45:10,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:45:10,056 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:45:10,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003708319] [2022-11-25 22:45:10,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003708319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:45:10,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:45:10,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:45:10,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97811484] [2022-11-25 22:45:10,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:45:10,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:45:10,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:45:10,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:45:10,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:45:10,057 INFO L87 Difference]: Start difference. First operand 5363 states and 7901 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-25 22:45:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:16,341 INFO L93 Difference]: Finished difference Result 5362 states and 7898 transitions. [2022-11-25 22:45:16,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:45:16,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-25 22:45:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:16,357 INFO L225 Difference]: With dead ends: 5362 [2022-11-25 22:45:16,357 INFO L226 Difference]: Without dead ends: 5362 [2022-11-25 22:45:16,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:45:16,358 INFO L413 NwaCegarLoop]: 2108 mSDtfsCounter, 4 mSDsluCounter, 3446 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5554 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:16,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5554 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-25 22:45:16,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2022-11-25 22:45:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 5362. [2022-11-25 22:45:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5362 states, 4479 states have (on average 1.7427997320830542) internal successors, (7806), 5316 states have internal predecessors, (7806), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 22:45:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5362 states to 5362 states and 7898 transitions. [2022-11-25 22:45:16,409 INFO L78 Accepts]: Start accepts. Automaton has 5362 states and 7898 transitions. Word has length 67 [2022-11-25 22:45:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:16,410 INFO L495 AbstractCegarLoop]: Abstraction has 5362 states and 7898 transitions. [2022-11-25 22:45:16,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-25 22:45:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 5362 states and 7898 transitions. [2022-11-25 22:45:16,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 22:45:16,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:16,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:45:16,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:16,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:16,626 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:45:16,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:16,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2022-11-25 22:45:16,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:45:16,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142440077] [2022-11-25 22:45:16,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:16,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-25 22:45:16,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:45:16,629 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:16,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-25 22:45:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:17,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 22:45:17,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:17,058 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-25 22:45:17,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:17,094 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-25 22:45:17,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-25 22:45:17,163 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-25 22:45:17,181 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-25 22:45:17,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:45:17,181 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:45:17,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142440077] [2022-11-25 22:45:17,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142440077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:45:17,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:45:17,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:45:17,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801278256] [2022-11-25 22:45:17,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:45:17,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:45:17,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:45:17,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:45:17,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:45:17,184 INFO L87 Difference]: Start difference. First operand 5362 states and 7898 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-25 22:45:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:25,830 INFO L93 Difference]: Finished difference Result 5361 states and 7895 transitions. [2022-11-25 22:45:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:45:25,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-25 22:45:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:25,835 INFO L225 Difference]: With dead ends: 5361 [2022-11-25 22:45:25,835 INFO L226 Difference]: Without dead ends: 5361 [2022-11-25 22:45:25,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:45:25,836 INFO L413 NwaCegarLoop]: 2108 mSDtfsCounter, 2 mSDsluCounter, 3447 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5555 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:25,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5555 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-11-25 22:45:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5361 states. [2022-11-25 22:45:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5361 to 5361. [2022-11-25 22:45:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5361 states, 4476 states have (on average 1.7432975871313674) internal successors, (7803), 5315 states have internal predecessors, (7803), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 22:45:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5361 states to 5361 states and 7895 transitions. [2022-11-25 22:45:25,949 INFO L78 Accepts]: Start accepts. Automaton has 5361 states and 7895 transitions. Word has length 67 [2022-11-25 22:45:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:25,949 INFO L495 AbstractCegarLoop]: Abstraction has 5361 states and 7895 transitions. [2022-11-25 22:45:25,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-25 22:45:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 5361 states and 7895 transitions. [2022-11-25 22:45:25,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 22:45:25,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:25,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] [2022-11-25 22:45:25,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:26,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:26,167 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:45:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:26,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017746, now seen corresponding path program 1 times [2022-11-25 22:45:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:45:26,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623900620] [2022-11-25 22:45:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:26,168 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-25 22:45:26,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:45:26,169 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:26,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-25 22:45:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:26,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 22:45:26,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:26,561 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-25 22:45:26,573 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-25 22:45:26,600 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-25 22:45:26,613 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-25 22:45:26,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:45:26,613 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:45:26,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623900620] [2022-11-25 22:45:26,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623900620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:45:26,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:45:26,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:45:26,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836724416] [2022-11-25 22:45:26,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:45:26,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:45:26,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:45:26,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:45:26,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:45:26,616 INFO L87 Difference]: Start difference. First operand 5361 states and 7895 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-25 22:45:32,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:32,875 INFO L93 Difference]: Finished difference Result 5360 states and 7891 transitions. [2022-11-25 22:45:32,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:45:32,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-25 22:45:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:32,880 INFO L225 Difference]: With dead ends: 5360 [2022-11-25 22:45:32,881 INFO L226 Difference]: Without dead ends: 5360 [2022-11-25 22:45:32,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:45:32,881 INFO L413 NwaCegarLoop]: 2106 mSDtfsCounter, 4 mSDsluCounter, 3443 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5549 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:32,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5549 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-11-25 22:45:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5360 states. [2022-11-25 22:45:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5360 to 5360. [2022-11-25 22:45:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5360 states, 4476 states have (on average 1.7424039320822162) internal successors, (7799), 5314 states have internal predecessors, (7799), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 22:45:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5360 states to 5360 states and 7891 transitions. [2022-11-25 22:45:32,933 INFO L78 Accepts]: Start accepts. Automaton has 5360 states and 7891 transitions. Word has length 67 [2022-11-25 22:45:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:32,934 INFO L495 AbstractCegarLoop]: Abstraction has 5360 states and 7891 transitions. [2022-11-25 22:45:32,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-25 22:45:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5360 states and 7891 transitions. [2022-11-25 22:45:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 22:45:32,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:32,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:45:32,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-11-25 22:45:33,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:33,150 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:45:33,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:33,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017745, now seen corresponding path program 1 times [2022-11-25 22:45:33,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:45:33,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472131590] [2022-11-25 22:45:33,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:33,151 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-25 22:45:33,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:45:33,152 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:33,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:33,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 22:45:33,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:33,577 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-25 22:45:33,602 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-25 22:45:33,612 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-25 22:45:33,670 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-25 22:45:33,676 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-25 22:45:33,695 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-25 22:45:33,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:45:33,696 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:45:33,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472131590] [2022-11-25 22:45:33,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472131590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:45:33,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:45:33,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:45:33,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899715490] [2022-11-25 22:45:33,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:45:33,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:45:33,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:45:33,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:45:33,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:45:33,697 INFO L87 Difference]: Start difference. First operand 5360 states and 7891 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-25 22:45:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:42,377 INFO L93 Difference]: Finished difference Result 5359 states and 7887 transitions. [2022-11-25 22:45:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:45:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-25 22:45:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:42,382 INFO L225 Difference]: With dead ends: 5359 [2022-11-25 22:45:42,382 INFO L226 Difference]: Without dead ends: 5359 [2022-11-25 22:45:42,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:45:42,383 INFO L413 NwaCegarLoop]: 2106 mSDtfsCounter, 2 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5550 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:42,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5550 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-11-25 22:45:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5359 states. [2022-11-25 22:45:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5359 to 5359. [2022-11-25 22:45:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5359 states, 4472 states have (on average 1.743067978533095) internal successors, (7795), 5313 states have internal predecessors, (7795), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 22:45:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5359 states to 5359 states and 7887 transitions. [2022-11-25 22:45:42,437 INFO L78 Accepts]: Start accepts. Automaton has 5359 states and 7887 transitions. Word has length 67 [2022-11-25 22:45:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:42,437 INFO L495 AbstractCegarLoop]: Abstraction has 5359 states and 7887 transitions. [2022-11-25 22:45:42,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-25 22:45:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 5359 states and 7887 transitions. [2022-11-25 22:45:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-25 22:45:42,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:42,439 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] [2022-11-25 22:45:42,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:42,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:42,654 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:45:42,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:42,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1457804367, now seen corresponding path program 1 times [2022-11-25 22:45:42,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:45:42,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184314199] [2022-11-25 22:45:42,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:42,655 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-25 22:45:42,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:45:42,656 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:42,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-25 22:45:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:43,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:45:43,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:43,140 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-25 22:45:43,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:45:43,140 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:45:43,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184314199] [2022-11-25 22:45:43,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184314199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:45:43,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:45:43,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:45:43,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505948178] [2022-11-25 22:45:43,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:45:43,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:45:43,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:45:43,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:45:43,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:45:43,144 INFO L87 Difference]: Start difference. First operand 5359 states and 7887 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-25 22:45:43,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:43,274 INFO L93 Difference]: Finished difference Result 5362 states and 7896 transitions. [2022-11-25 22:45:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:45:43,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2022-11-25 22:45:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:43,293 INFO L225 Difference]: With dead ends: 5362 [2022-11-25 22:45:43,294 INFO L226 Difference]: Without dead ends: 5362 [2022-11-25 22:45:43,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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-25 22:45:43,295 INFO L413 NwaCegarLoop]: 2105 mSDtfsCounter, 2 mSDsluCounter, 4202 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6307 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:43,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6307 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:45:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2022-11-25 22:45:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 5362. [2022-11-25 22:45:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5362 states, 4474 states have (on average 1.7429593205185516) internal successors, (7798), 5316 states have internal predecessors, (7798), 46 states have call successors, (46), 3 states have call predecessors, (46), 4 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-25 22:45:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5362 states to 5362 states and 7896 transitions. [2022-11-25 22:45:43,385 INFO L78 Accepts]: Start accepts. Automaton has 5362 states and 7896 transitions. Word has length 75 [2022-11-25 22:45:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:43,386 INFO L495 AbstractCegarLoop]: Abstraction has 5362 states and 7896 transitions. [2022-11-25 22:45:43,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-25 22:45:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 5362 states and 7896 transitions. [2022-11-25 22:45:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-25 22:45:43,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:43,387 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] [2022-11-25 22:45:43,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:43,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:43,601 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:45:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:43,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1162843208, now seen corresponding path program 1 times [2022-11-25 22:45:43,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:45:43,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445356408] [2022-11-25 22:45:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:43,603 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-25 22:45:43,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:45:43,604 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:43,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-25 22:45:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:44,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:45:44,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:44,086 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-25 22:45:44,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:44,183 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-25 22:45:44,183 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:45:44,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445356408] [2022-11-25 22:45:44,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445356408] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:45:44,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1182680533] [2022-11-25 22:45:44,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:44,184 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:45:44,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:45:44,188 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:45:44,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-25 22:45:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:44,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:45:44,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:45:44,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:45,034 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-25 22:45:45,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1182680533] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:45:45,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755973925] [2022-11-25 22:45:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:45,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:45:45,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:45:45,042 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:45:45,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-25 22:45:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:45,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:45:45,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:45,538 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-25 22:45:45,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:45,586 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-25 22:45:45,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755973925] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:45:45,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:45:45,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-25 22:45:45,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154765909] [2022-11-25 22:45:45,587 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:45:45,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:45:45,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:45:45,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:45:45,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:45:45,589 INFO L87 Difference]: Start difference. First operand 5362 states and 7896 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:45:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:45,862 INFO L93 Difference]: Finished difference Result 5374 states and 7918 transitions. [2022-11-25 22:45:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 22:45:45,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-11-25 22:45:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:45,875 INFO L225 Difference]: With dead ends: 5374 [2022-11-25 22:45:45,875 INFO L226 Difference]: Without dead ends: 5374 [2022-11-25 22:45:45,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-25 22:45:45,876 INFO L413 NwaCegarLoop]: 2105 mSDtfsCounter, 12 mSDsluCounter, 4204 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6309 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:45,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6309 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:45:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5374 states. [2022-11-25 22:45:45,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5374 to 5372. [2022-11-25 22:45:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5372 states, 4483 states have (on average 1.7428061565915682) internal successors, (7813), 5325 states have internal predecessors, (7813), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-25 22:45:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5372 states to 5372 states and 7911 transitions. [2022-11-25 22:45:45,986 INFO L78 Accepts]: Start accepts. Automaton has 5372 states and 7911 transitions. Word has length 76 [2022-11-25 22:45:45,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:45,986 INFO L495 AbstractCegarLoop]: Abstraction has 5372 states and 7911 transitions. [2022-11-25 22:45:45,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:45:45,987 INFO L276 IsEmpty]: Start isEmpty. Operand 5372 states and 7911 transitions. [2022-11-25 22:45:45,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-25 22:45:45,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:45,988 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] [2022-11-25 22:45:46,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:46,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:46,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:46,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:46,600 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:45:46,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:46,601 INFO L85 PathProgramCache]: Analyzing trace with hash 934349455, now seen corresponding path program 2 times [2022-11-25 22:45:46,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:45:46,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435571033] [2022-11-25 22:45:46,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:45:46,601 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-25 22:45:46,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:45:46,602 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:45:46,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-25 22:45:47,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:45:47,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:45:47,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 22:45:47,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:47,292 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-25 22:45:47,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:47,555 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-25 22:45:47,556 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:45:47,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435571033] [2022-11-25 22:45:47,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435571033] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:45:47,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [645912390] [2022-11-25 22:45:47,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:45:47,556 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:45:47,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:45:47,558 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:45:47,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-25 22:45:49,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:45:49,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:45:49,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 22:45:49,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:49,544 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-25 22:45:49,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:49,638 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-25 22:45:49,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [645912390] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:45:49,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674804632] [2022-11-25 22:45:49,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:45:49,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:45:49,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:45:49,643 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:45:49,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-25 22:46:03,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:46:03,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:46:03,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 22:46:03,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:46:03,465 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:46:03,465 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-25 22:46:03,500 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-25 22:46:04,003 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:46:04,003 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-25 22:46:04,086 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-25 22:46:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 22:46:04,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:46:04,254 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-25 22:46:04,254 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-25 22:46:04,263 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_2339) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem39#1.base|)) is different from false [2022-11-25 22:46:04,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674804632] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:46:04,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-25 22:46:04,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-25 22:46:04,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82872280] [2022-11-25 22:46:04,267 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-25 22:46:04,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 22:46:04,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:46:04,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 22:46:04,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-11-25 22:46:04,269 INFO L87 Difference]: Start difference. First operand 5372 states and 7911 transitions. Second operand has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:46:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:46:48,891 INFO L93 Difference]: Finished difference Result 13466 states and 20742 transitions. [2022-11-25 22:46:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-25 22:46:48,892 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 79 [2022-11-25 22:46:48,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:46:48,916 INFO L225 Difference]: With dead ends: 13466 [2022-11-25 22:46:48,917 INFO L226 Difference]: Without dead ends: 13462 [2022-11-25 22:46:48,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 368 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=475, Invalid=2692, Unknown=29, NotChecked=110, Total=3306 [2022-11-25 22:46:48,919 INFO L413 NwaCegarLoop]: 1948 mSDtfsCounter, 4263 mSDsluCounter, 30238 mSDsCounter, 0 mSdLazyCounter, 22914 mSolverCounterSat, 101 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4283 SdHoareTripleChecker+Valid, 32186 SdHoareTripleChecker+Invalid, 23024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 22914 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:46:48,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4283 Valid, 32186 Invalid, 23024 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [101 Valid, 22914 Invalid, 9 Unknown, 0 Unchecked, 42.3s Time] [2022-11-25 22:46:48,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13462 states. [2022-11-25 22:46:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13462 to 5380. [2022-11-25 22:46:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5380 states, 4492 states have (on average 1.7413178984861977) internal successors, (7822), 5333 states have internal predecessors, (7822), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-25 22:46:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5380 states to 5380 states and 7920 transitions. [2022-11-25 22:46:49,038 INFO L78 Accepts]: Start accepts. Automaton has 5380 states and 7920 transitions. Word has length 79 [2022-11-25 22:46:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:46:49,039 INFO L495 AbstractCegarLoop]: Abstraction has 5380 states and 7920 transitions. [2022-11-25 22:46:49,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:46:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 5380 states and 7920 transitions. [2022-11-25 22:46:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-25 22:46:49,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:46:49,040 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] [2022-11-25 22:46:49,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-11-25 22:46:49,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-25 22:46:49,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-11-25 22:46:49,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:46:49,657 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:46:49,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:46:49,658 INFO L85 PathProgramCache]: Analyzing trace with hash 71270384, now seen corresponding path program 1 times [2022-11-25 22:46:49,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:46:49,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431060196] [2022-11-25 22:46:49,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:46:49,659 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-25 22:46:49,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:46:49,659 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:46:49,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-25 22:46:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:46:50,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:46:50,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:46:50,398 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-25 22:46:50,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:46:51,212 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-25 22:46:51,212 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:46:51,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431060196] [2022-11-25 22:46:51,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431060196] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:46:51,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [822694031] [2022-11-25 22:46:51,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:46:51,213 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:46:51,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:46:51,214 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:46:51,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-25 22:46:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:46:52,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:46:52,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:46:52,165 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-25 22:46:52,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:46:52,381 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-25 22:46:52,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [822694031] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:46:52,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555997559] [2022-11-25 22:46:52,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:46:52,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:46:52,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:46:52,383 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:46:52,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-25 22:46:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:46:52,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 22:46:52,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:46:53,047 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-25 22:46:53,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:46:54,173 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-25 22:46:54,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555997559] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:46:54,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:46:54,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-11-25 22:46:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120176371] [2022-11-25 22:46:54,174 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:46:54,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 22:46:54,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:46:54,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 22:46:54,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 22:46:54,176 INFO L87 Difference]: Start difference. First operand 5380 states and 7920 transitions. Second operand has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 22:46:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:46:58,584 INFO L93 Difference]: Finished difference Result 5422 states and 8022 transitions. [2022-11-25 22:46:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-25 22:46:58,585 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 85 [2022-11-25 22:46:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:46:58,597 INFO L225 Difference]: With dead ends: 5422 [2022-11-25 22:46:58,597 INFO L226 Difference]: Without dead ends: 5416 [2022-11-25 22:46:58,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2022-11-25 22:46:58,599 INFO L413 NwaCegarLoop]: 2111 mSDtfsCounter, 46 mSDsluCounter, 27372 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 29483 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:46:58,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 29483 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-25 22:46:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5416 states. [2022-11-25 22:46:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5416 to 5398. [2022-11-25 22:46:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5398 states, 4510 states have (on average 1.7394678492239468) internal successors, (7845), 5351 states have internal predecessors, (7845), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-25 22:46:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5398 states to 5398 states and 7943 transitions. [2022-11-25 22:46:58,701 INFO L78 Accepts]: Start accepts. Automaton has 5398 states and 7943 transitions. Word has length 85 [2022-11-25 22:46:58,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:46:58,702 INFO L495 AbstractCegarLoop]: Abstraction has 5398 states and 7943 transitions. [2022-11-25 22:46:58,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 22:46:58,702 INFO L276 IsEmpty]: Start isEmpty. Operand 5398 states and 7943 transitions. [2022-11-25 22:46:58,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-25 22:46:58,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:46:58,704 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] [2022-11-25 22:46:58,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-25 22:46:58,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-25 22:46:59,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-11-25 22:46:59,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:46:59,317 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:46:59,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:46:59,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2019676848, now seen corresponding path program 2 times [2022-11-25 22:46:59,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:46:59,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072575779] [2022-11-25 22:46:59,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:46:59,319 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-25 22:46:59,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:46:59,326 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:46:59,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-25 22:47:00,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:47:00,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:47:00,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 22:47:00,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:47:00,764 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-25 22:47:00,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:47:03,163 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-25 22:47:03,163 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:47:03,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072575779] [2022-11-25 22:47:03,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072575779] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:47:03,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2001551607] [2022-11-25 22:47:03,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:47:03,165 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:47:03,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:47:03,166 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:47:03,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-25 22:47:05,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:47:05,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:47:05,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 22:47:05,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:47:05,749 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-25 22:47:05,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:47:06,209 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-25 22:47:06,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2001551607] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:47:06,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695414820] [2022-11-25 22:47:06,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:47:06,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:47:06,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:47:06,211 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:47:06,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-25 22:47:18,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:47:18,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:47:18,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-25 22:47:18,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:47:18,443 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-25 22:47:18,456 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:47:18,456 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-25 22:47:18,567 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-25 22:47:18,577 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-25 22:47:18,970 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-25 22:47:18,976 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-25 22:47:19,153 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:47:19,168 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3554) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:47:19,182 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3555))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:47:19,352 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559))) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560)))) is different from true [2022-11-25 22:47:19,509 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:47:19,656 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:47:19,668 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570)))) is different from true [2022-11-25 22:47:19,683 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3572))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3571)))) is different from true [2022-11-25 22:47:19,972 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:47:19,984 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3580))) (exists ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3579) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:47:19,996 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582)))) is different from true [2022-11-25 22:47:20,008 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3583))) (exists ((v_ArrVal_3584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3584)))) is different from true [2022-11-25 22:47:20,020 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586)))) is different from true [2022-11-25 22:47:20,032 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588))) (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:47:20,044 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590)))) is different from true [2022-11-25 22:47:20,057 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592)))) is different from true [2022-11-25 22:47:20,069 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:47:20,128 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:47:20,129 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-25 22:47:20,142 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-25 22:47:20,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:47:20,343 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-25 22:47:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 238 not checked. [2022-11-25 22:47:20,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:47:21,392 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3641 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3641) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3641 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3641) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-25 22:47:21,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695414820] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:47:21,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-25 22:47:21,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 26] total 75 [2022-11-25 22:47:21,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217298306] [2022-11-25 22:47:21,401 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-25 22:47:21,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-25 22:47:21,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:47:21,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-25 22:47:21,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=2840, Unknown=40, NotChecked=2394, Total=6006 [2022-11-25 22:47:21,404 INFO L87 Difference]: Start difference. First operand 5398 states and 7943 transitions. Second operand has 75 states, 74 states have (on average 2.675675675675676) internal successors, (198), 75 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:48:10,195 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3572))) (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589))) (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559))) (exists ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3580))) (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3571))) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592))) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3579) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3583))) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557))) (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590))) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_ArrVal_3584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3584))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582)))) is different from true [2022-11-25 22:49:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:49:59,028 INFO L93 Difference]: Finished difference Result 14229 states and 21947 transitions. [2022-11-25 22:49:59,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-11-25 22:49:59,028 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 2.675675675675676) internal successors, (198), 75 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 97 [2022-11-25 22:49:59,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:49:59,054 INFO L225 Difference]: With dead ends: 14229 [2022-11-25 22:49:59,054 INFO L226 Difference]: Without dead ends: 14213 [2022-11-25 22:49:59,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 404 SyntacticMatches, 5 SemanticMatches, 199 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 7838 ImplicationChecksByTransitivity, 46.0s TimeCoverageRelationStatistics Valid=6574, Invalid=26308, Unknown=136, NotChecked=7182, Total=40200 [2022-11-25 22:49:59,063 INFO L413 NwaCegarLoop]: 2179 mSDtfsCounter, 4200 mSDsluCounter, 62289 mSDsCounter, 0 mSdLazyCounter, 54480 mSolverCounterSat, 199 mSolverCounterUnsat, 1507 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 102.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4257 SdHoareTripleChecker+Valid, 64468 SdHoareTripleChecker+Invalid, 133163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.6s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 54480 IncrementalHoareTripleChecker+Invalid, 1507 IncrementalHoareTripleChecker+Unknown, 76977 IncrementalHoareTripleChecker+Unchecked, 113.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:49:59,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4257 Valid, 64468 Invalid, 133163 Unknown, 0 Unchecked, 0.6s Time], IncrementalHoareTripleChecker [199 Valid, 54480 Invalid, 1507 Unknown, 76977 Unchecked, 113.8s Time] [2022-11-25 22:49:59,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14213 states. [2022-11-25 22:49:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14213 to 5480. [2022-11-25 22:49:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5480 states, 4592 states have (on average 1.7284407665505226) internal successors, (7937), 5432 states have internal predecessors, (7937), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-25 22:49:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 8035 transitions. [2022-11-25 22:49:59,225 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 8035 transitions. Word has length 97 [2022-11-25 22:49:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:49:59,226 INFO L495 AbstractCegarLoop]: Abstraction has 5480 states and 8035 transitions. [2022-11-25 22:49:59,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 2.675675675675676) internal successors, (198), 75 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:49:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 8035 transitions. [2022-11-25 22:49:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-25 22:49:59,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:49:59,229 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:49:59,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-11-25 22:49:59,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-25 22:49:59,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-25 22:49:59,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:49:59,839 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:49:59,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:49:59,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1446350987, now seen corresponding path program 1 times [2022-11-25 22:49:59,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:49:59,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225890257] [2022-11-25 22:49:59,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:49:59,840 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-25 22:49:59,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:49:59,841 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:49:59,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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)] Waiting until timeout for monitored process [2022-11-25 22:50:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:50:00,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:50:00,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:50:00,749 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-25 22:50:00,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:50:00,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:50:00,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:50:00,764 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-25 22:50:00,863 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:50:00,864 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-25 22:50:00,964 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 45 treesize of output 41 [2022-11-25 22:50:01,065 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 45 treesize of output 41 [2022-11-25 22:50:01,138 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:50:01,139 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-25 22:50:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-11-25 22:50:01,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:50:01,165 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:50:01,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225890257] [2022-11-25 22:50:01,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225890257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:50:01,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:50:01,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 22:50:01,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790217719] [2022-11-25 22:50:01,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:50:01,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:50:01,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:50:01,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:50:01,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:50:01,168 INFO L87 Difference]: Start difference. First operand 5480 states and 8035 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-25 22:50:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:50:12,868 INFO L93 Difference]: Finished difference Result 5661 states and 7966 transitions. [2022-11-25 22:50:12,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:50:12,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 119 [2022-11-25 22:50:12,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:50:12,879 INFO L225 Difference]: With dead ends: 5661 [2022-11-25 22:50:12,880 INFO L226 Difference]: Without dead ends: 5661 [2022-11-25 22:50:12,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:50:12,881 INFO L413 NwaCegarLoop]: 1411 mSDtfsCounter, 2052 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 4158 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 5965 SdHoareTripleChecker+Invalid, 4188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:50:12,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2062 Valid, 5965 Invalid, 4188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4158 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2022-11-25 22:50:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5661 states. [2022-11-25 22:50:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5661 to 5080. [2022-11-25 22:50:12,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5080 states, 4193 states have (on average 1.7522060577152396) internal successors, (7347), 5035 states have internal predecessors, (7347), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-25 22:50:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 7438 transitions. [2022-11-25 22:50:12,943 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 7438 transitions. Word has length 119 [2022-11-25 22:50:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:50:12,943 INFO L495 AbstractCegarLoop]: Abstraction has 5080 states and 7438 transitions. [2022-11-25 22:50:12,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-25 22:50:12,943 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 7438 transitions. [2022-11-25 22:50:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-25 22:50:12,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:50:12,945 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] [2022-11-25 22:50:12,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 22:50:13,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:50:13,165 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:50:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:50:13,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1028969817, now seen corresponding path program 1 times [2022-11-25 22:50:13,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:50:13,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359745923] [2022-11-25 22:50:13,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:50:13,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-25 22:50:13,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:50:13,168 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:50:13,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:50:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:50:14,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-25 22:50:14,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:50:14,229 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-25 22:50:14,369 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:50:14,369 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-25 22:50:14,396 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-25 22:50:14,499 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-25 22:50:15,072 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4411)))) is different from true [2022-11-25 22:50:15,253 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4417)))) is different from true [2022-11-25 22:50:15,569 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4426)))) is different from true [2022-11-25 22:50:15,586 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4427) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:50:15,948 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4438)))) is different from true [2022-11-25 22:50:16,143 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:50:16,143 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-25 22:50:16,298 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:50:16,298 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-25 22:50:16,324 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-25 22:50:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 741 trivial. 210 not checked. [2022-11-25 22:50:16,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:50:16,448 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4443 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_4443) |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-25 22:50:16,460 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4443 (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_4443) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:50:16,766 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4489 (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~mem39#1.base| v_ArrVal_4489))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4443)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:50:16,769 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:50:16,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359745923] [2022-11-25 22:50:16,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359745923] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:50:16,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [380277978] [2022-11-25 22:50:16,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:50:16,770 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:50:16,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:50:16,771 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:50:16,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-11-25 22:50:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:50:21,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 22:50:21,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:50:21,149 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-25 22:50:21,300 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:50:21,300 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-25 22:50:21,318 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-25 22:50:21,390 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-25 22:50:21,542 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4871 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4871) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:50:21,632 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4874) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:50:21,764 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4878)))) is different from true [2022-11-25 22:50:21,932 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4883)))) is different from true [2022-11-25 22:50:21,951 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4884)))) is different from true [2022-11-25 22:50:22,313 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4894)))) is different from true [2022-11-25 22:50:22,684 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905)))) is different from true [2022-11-25 22:50:22,847 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4910) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:50:22,959 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:50:22,959 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-25 22:50:23,042 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:50:23,042 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-25 22:50:23,068 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-25 22:50:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 324 not checked. [2022-11-25 22:50:23,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:50:23,096 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4913 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_4913) |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-25 22:50:23,107 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4913 (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_4913) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:50:23,405 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4959 (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~mem39#1.base| v_ArrVal_4959))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4913)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:50:23,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [380277978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:50:23,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408861753] [2022-11-25 22:50:23,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:50:23,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:50:23,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:50:23,409 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:50:23,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-25 22:50:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:50:24,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-25 22:50:24,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:50:24,336 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:50:24,336 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-25 22:50:24,371 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-25 22:50:24,505 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5337))) is different from true [2022-11-25 22:50:24,510 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5338))) is different from true [2022-11-25 22:50:24,515 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5339))) is different from true [2022-11-25 22:50:24,521 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5340))) is different from true [2022-11-25 22:50:24,526 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5341) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,531 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5342))) is different from true [2022-11-25 22:50:24,536 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5343))) is different from true [2022-11-25 22:50:24,541 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5344) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,546 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5345))) is different from true [2022-11-25 22:50:24,551 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5346))) is different from true [2022-11-25 22:50:24,556 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5347) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,562 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348))) is different from true [2022-11-25 22:50:24,571 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5349))) is different from true [2022-11-25 22:50:24,576 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5350) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,582 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5351) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,587 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352))) is different from true [2022-11-25 22:50:24,594 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5353) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,604 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5354) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,610 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5355))) is different from true [2022-11-25 22:50:24,616 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5356) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,623 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5357) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,629 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5358) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,636 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5359 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5359) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,642 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,648 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) is different from true [2022-11-25 22:50:24,654 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5362))) is different from true [2022-11-25 22:50:24,660 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5363))) is different from true [2022-11-25 22:50:24,666 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5364))) is different from true [2022-11-25 22:50:24,672 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5365) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,678 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5366 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5366) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,684 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5367))) is different from true [2022-11-25 22:50:24,690 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5368 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5368) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,696 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5369 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5369))) is different from true [2022-11-25 22:50:24,702 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5370) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,707 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5371 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5371) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,712 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5372) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,718 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5373))) is different from true [2022-11-25 22:50:24,723 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5374) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,728 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5375))) is different from true [2022-11-25 22:50:24,733 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5376) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,739 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5377))) is different from true [2022-11-25 22:50:24,748 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5378) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,754 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5379) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 22:50:24,761 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5380))) is different from true [2022-11-25 22:50:24,789 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:50:24,790 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-25 22:50:24,879 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:50:24,880 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-25 22:50:24,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 33 treesize of output 15 [2022-11-25 22:50:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-25 22:50:24,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:50:24,987 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-25 22:50:24,987 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-25 22:50:24,996 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem41#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5381) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2022-11-25 22:50:25,007 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5381 (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_5381) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-25 22:50:25,323 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5427)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_5381) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2022-11-25 22:50:25,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408861753] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:50:25,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:50:25,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 54] total 74 [2022-11-25 22:50:25,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438974981] [2022-11-25 22:50:25,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:50:25,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-25 22:50:25,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:50:25,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-25 22:50:25,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=335, Unknown=80, NotChecked=6534, Total=7140 [2022-11-25 22:50:25,352 INFO L87 Difference]: Start difference. First operand 5080 states and 7438 transitions. Second operand has 75 states, 72 states have (on average 2.6944444444444446) internal successors, (194), 75 states have internal predecessors, (194), 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-25 22:50:26,995 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_5337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5337))) (exists ((v_ArrVal_4399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4399)))) is different from true [2022-11-25 22:50:27,000 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4438))) (exists ((v_ArrVal_4878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4878))) (exists ((v_ArrVal_4411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4411))) (exists ((v_ArrVal_4426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4426))) (exists ((v_ArrVal_4883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4883))) (exists ((v_ArrVal_4894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4894))) (exists ((v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4874) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4871 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4871) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4417))) (exists ((v_ArrVal_4399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4399))) (exists ((v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4910) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5338))) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905)))) is different from true [2022-11-25 22:50:27,082 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4438))) (exists ((v_ArrVal_4878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4878))) (exists ((v_ArrVal_4411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4411))) (exists ((v_ArrVal_4426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4426))) (exists ((v_ArrVal_4883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4883))) (exists ((v_ArrVal_4894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4894))) (exists ((v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4874) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4884))) (exists ((v_ArrVal_4871 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4871) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4417))) (exists ((v_ArrVal_4399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4399))) (exists ((v_ArrVal_5340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5340))) (exists ((v_ArrVal_4427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4427) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4910) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905)))) is different from true [2022-11-25 22:51:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:51:14,340 INFO L93 Difference]: Finished difference Result 13101 states and 20220 transitions. [2022-11-25 22:51:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-25 22:51:14,340 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 72 states have (on average 2.6944444444444446) internal successors, (194), 75 states have internal predecessors, (194), 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 122 [2022-11-25 22:51:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:51:14,360 INFO L225 Difference]: With dead ends: 13101 [2022-11-25 22:51:14,360 INFO L226 Difference]: Without dead ends: 13101 [2022-11-25 22:51:14,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 225 SyntacticMatches, 79 SemanticMatches, 94 ConstructedPredicates, 69 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=274, Invalid=613, Unknown=91, NotChecked=8142, Total=9120 [2022-11-25 22:51:14,362 INFO L413 NwaCegarLoop]: 1993 mSDtfsCounter, 4113 mSDsluCounter, 20025 mSDsCounter, 0 mSdLazyCounter, 16854 mSolverCounterSat, 49 mSolverCounterUnsat, 2794 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4128 SdHoareTripleChecker+Valid, 22018 SdHoareTripleChecker+Invalid, 256515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 16854 IncrementalHoareTripleChecker+Invalid, 2794 IncrementalHoareTripleChecker+Unknown, 236818 IncrementalHoareTripleChecker+Unchecked, 47.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:51:14,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4128 Valid, 22018 Invalid, 256515 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [49 Valid, 16854 Invalid, 2794 Unknown, 236818 Unchecked, 47.5s Time] [2022-11-25 22:51:14,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13101 states. [2022-11-25 22:51:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13101 to 5079. [2022-11-25 22:51:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5079 states, 4193 states have (on average 1.7514905795373241) internal successors, (7344), 5034 states have internal predecessors, (7344), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-25 22:51:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 7435 transitions. [2022-11-25 22:51:14,481 INFO L78 Accepts]: Start accepts. Automaton has 5079 states and 7435 transitions. Word has length 122 [2022-11-25 22:51:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:51:14,482 INFO L495 AbstractCegarLoop]: Abstraction has 5079 states and 7435 transitions. [2022-11-25 22:51:14,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 72 states have (on average 2.6944444444444446) internal successors, (194), 75 states have internal predecessors, (194), 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-25 22:51:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 5079 states and 7435 transitions. [2022-11-25 22:51:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-25 22:51:14,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:51:14,483 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] [2022-11-25 22:51:14,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-11-25 22:51:14,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:51:14,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2022-11-25 22:51:15,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:51:15,108 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-25 22:51:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:51:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1028969818, now seen corresponding path program 1 times [2022-11-25 22:51:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:51:15,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58594435] [2022-11-25 22:51:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:51:15,109 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-25 22:51:15,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:51:15,110 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:51:15,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/mathsat -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-25 22:51:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:51:16,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-25 22:51:16,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:51:16,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-25 22:51:16,384 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:51:16,384 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-25 22:51:16,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:51:16,414 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-25 22:51:16,423 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-25 22:51:16,541 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-25 22:51:16,546 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-25 22:51:16,605 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5809))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5810 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5810) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:51:16,617 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5811))) (exists ((v_ArrVal_5812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5812)))) is different from true [2022-11-25 22:51:16,736 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5820) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5819)))) is different from true [2022-11-25 22:51:16,784 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5824))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5823) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:51:16,825 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5828 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5828))) (exists ((v_ArrVal_5827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5827)))) is different from true [2022-11-25 22:51:16,837 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5830))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829)))) is different from true [2022-11-25 22:51:16,865 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5832) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:51:16,877 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5834))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5833 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5833) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:51:16,888 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5835))) (exists ((v_ArrVal_5836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5836) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:51:16,902 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5837) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838)))) is different from true [2022-11-25 22:51:16,914 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5840 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5840) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839)))) is different from true [2022-11-25 22:51:16,926 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5842 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5842))) (exists ((v_ArrVal_5841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5841)))) is different from true [2022-11-25 22:51:16,938 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5844 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5844))) (exists ((v_ArrVal_5843 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5843)))) is different from true [2022-11-25 22:51:16,950 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5846 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5846))) (exists ((v_ArrVal_5845 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5845) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:51:16,961 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5847))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5848)))) is different from true [2022-11-25 22:51:16,973 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5849) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850)))) is different from true [2022-11-25 22:51:16,992 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5851))) (exists ((v_ArrVal_5852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5852))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-25 22:51:17,006 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5853))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5854)))) is different from true [2022-11-25 22:51:17,019 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5856))) (exists ((v_ArrVal_5855 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5855) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-25 22:51:17,033 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5857))) (exists ((v_ArrVal_5858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5858)))) is different from true [2022-11-25 22:51:17,047 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5860) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5859)))) is different from true [2022-11-25 22:51:17,060 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5862))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5861) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:51:17,072 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5863))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5864)))) is different from true [2022-11-25 22:51:17,084 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5865))) (exists ((v_ArrVal_5866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5866)))) is different from true [2022-11-25 22:51:17,096 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5867))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5868)))) is different from true [2022-11-25 22:51:17,108 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5869))) (exists ((v_ArrVal_5870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5870) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:51:17,126 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5871))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5872)))) is different from true [2022-11-25 22:51:17,140 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5873) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5874)))) is different from true [2022-11-25 22:51:17,155 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5875))) (exists ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5876)))) is different from true [2022-11-25 22:51:17,169 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5878))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5877)))) is different from true [2022-11-25 22:51:17,183 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5879))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5880) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:51:17,197 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5881))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5882)))) is different from true [2022-11-25 22:51:17,211 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5884))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5883)))) is different from true [2022-11-25 22:51:17,226 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5885 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5885))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5886 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5886) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:51:17,240 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5887))) (exists ((v_ArrVal_5888 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5888) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:51:17,254 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5889 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5889) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5890 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5890) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:51:17,268 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5892))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5891)))) is different from true [2022-11-25 22:51:17,282 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5893) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5894)))) is different from true [2022-11-25 22:51:17,303 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5896 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5896) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5895 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5895) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:51:17,355 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:51:17,356 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-25 22:51:17,367 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-25 22:51:17,486 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:51:17,487 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-25 22:51:17,498 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-25 22:51:17,527 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-25 22:51:17,534 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-25 22:51:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 975 not checked. [2022-11-25 22:51:17,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:51:17,787 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5898) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-25 22:51:17,834 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_5898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5898) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-25 22:51:18,867 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5989) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5990) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5990))) (let ((.cse2 (select (select .cse3 |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~mem39#1.base| v_ArrVal_5989) .cse2 v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5898) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-25 22:51:18,881 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:51:18,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58594435] [2022-11-25 22:51:18,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58594435] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:51:18,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1750183383] [2022-11-25 22:51:18,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:51:18,882 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:51:18,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:51:18,884 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:51:18,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-11-25 22:53:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:53:26,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-25 22:53:26,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:53:26,659 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-25 22:53:26,800 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:53:26,801 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-25 22:53:26,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:53:26,820 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-25 22:53:26,830 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-25 22:53:26,914 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-25 22:53:26,919 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-25 22:53:26,976 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6372))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6373)))) is different from true [2022-11-25 22:53:26,993 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6374))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6375)))) is different from true [2022-11-25 22:53:27,007 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6377))) (exists ((v_ArrVal_6376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6376)))) is different from true [2022-11-25 22:53:27,019 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6378))) (exists ((v_ArrVal_6379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6379)))) is different from true [2022-11-25 22:53:27,032 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6380 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6380) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6381))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-25 22:53:27,044 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6383 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6383) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6382)))) is different from true [2022-11-25 22:53:27,057 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6384) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6385 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6385) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:53:27,070 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6386))) (exists ((v_ArrVal_6387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6387) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:53:27,087 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6388) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6389)))) is different from true [2022-11-25 22:53:27,103 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6390) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6391)))) is different from true [2022-11-25 22:53:27,119 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6392))) (exists ((v_ArrVal_6393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6393)))) is different from true [2022-11-25 22:53:27,135 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6394))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-25 22:53:27,152 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6397))) (exists ((v_ArrVal_6396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6396) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-25 22:53:27,169 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6398 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6398))) (exists ((v_ArrVal_6399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6399)))) is different from true [2022-11-25 22:53:27,186 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6400) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6401)))) is different from true [2022-11-25 22:53:27,203 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6403))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6402)))) is different from true [2022-11-25 22:53:27,219 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6404 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6404) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6405) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:53:27,234 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6406))) (exists ((v_ArrVal_6407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6407)))) is different from true [2022-11-25 22:53:27,250 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6408) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6409) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:53:27,264 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6411) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6410)))) is different from true [2022-11-25 22:53:27,278 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6413))) (exists ((v_ArrVal_6412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6412)))) is different from true [2022-11-25 22:53:27,294 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6414))) (exists ((v_ArrVal_6415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6415))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-25 22:53:27,309 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6416))) (exists ((v_ArrVal_6417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6417) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:53:27,324 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6418))) (exists ((v_ArrVal_6419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6419)))) is different from true [2022-11-25 22:53:27,338 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6420))) (exists ((v_ArrVal_6421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6421)))) is different from true [2022-11-25 22:53:27,354 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6423 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6423))) (exists ((v_ArrVal_6422 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6422)))) is different from true [2022-11-25 22:53:27,368 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6424))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6425)))) is different from true [2022-11-25 22:53:27,383 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6427) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6426)))) is different from true [2022-11-25 22:53:27,398 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6429))) (exists ((v_ArrVal_6428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6428)))) is different from true [2022-11-25 22:53:27,412 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6430))) (exists ((v_ArrVal_6431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6431)))) is different from true [2022-11-25 22:53:27,427 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6432 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6432) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6433 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6433) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:53:27,444 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6434))) (exists ((v_ArrVal_6435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6435)))) is different from true [2022-11-25 22:53:27,461 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6437))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6436 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6436) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:53:27,488 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6438 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6438) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6439 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6439) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:53:27,502 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6440) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6441 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6441) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:53:27,518 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6443 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6443) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6442 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6442))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-25 22:53:27,531 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6444 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6444) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6445)))) is different from true [2022-11-25 22:53:27,544 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6446))) (exists ((v_ArrVal_6447 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6447) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:53:27,556 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6449))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6448)))) is different from true [2022-11-25 22:53:27,568 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6451))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6450)))) is different from true [2022-11-25 22:53:27,580 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6452) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6453) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:53:27,592 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6454))) (exists ((v_ArrVal_6455 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6455) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-25 22:53:27,603 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6457 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6457) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6456))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-25 22:53:27,617 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6459) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6458)))) is different from true [2022-11-25 22:53:27,667 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:53:27,668 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-25 22:53:27,679 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-25 22:53:27,756 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:53:27,757 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-25 22:53:27,765 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-25 22:53:27,796 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-25 22:53:27,812 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-25 22:53:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-25 22:53:27,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:53:27,906 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-25 22:53:27,951 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_6461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-25 22:53:28,976 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6552))) (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~mem39#1.base| v_ArrVal_6553) .cse0 v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6553) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6552) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-25 22:53:28,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1750183383] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:53:28,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562818114] [2022-11-25 22:53:28,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:53:28,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:53:28,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:53:28,998 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:53:29,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6e78b89-3255-43eb-ad50-680e7335c9e3/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-25 22:53:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:53:29,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-25 22:53:29,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:53:30,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:53:30,139 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:53:30,139 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-25 22:53:30,155 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-25 22:53:30,170 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-25 22:53:30,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 22:53:30,241 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-25 22:53:30,297 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934)))) is different from true [2022-11-25 22:53:30,347 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6938))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6939) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:53:30,397 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6943))) (exists ((v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6942)))) is different from true [2022-11-25 22:53:30,410 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6944))) (exists ((v_ArrVal_6945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6945) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:53:30,424 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6946))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6947) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:53:30,438 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6948))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6949 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6949) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:53:30,451 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6950))) (exists ((v_ArrVal_6951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6951)))) is different from true [2022-11-25 22:53:30,472 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6952))) (exists ((v_ArrVal_6953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6953) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-25 22:53:30,488 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6954) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6955) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-25 22:53:30,503 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956)))) is different from true [2022-11-25 22:53:30,519 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6959))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6958)))) is different from true [2022-11-25 22:53:30,534 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6961) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6960 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6960) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:53:30,550 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962)))) is different from true [2022-11-25 22:53:30,579 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6964))) (exists ((v_ArrVal_6965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6965) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:53:30,593 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6967) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6966)))) is different from true [2022-11-25 22:53:30,609 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969)))) is different from true [2022-11-25 22:53:30,625 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6970))) (exists ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6971) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:53:30,641 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6973))) (exists ((v_ArrVal_6972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6972)))) is different from true [2022-11-25 22:53:30,658 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6975))) (exists ((v_ArrVal_6974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6974)))) is different from true [2022-11-25 22:53:30,673 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6976))) (exists ((v_ArrVal_6977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6977)))) is different from true [2022-11-25 22:53:30,689 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6978))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6979 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6979)))) is different from true [2022-11-25 22:53:30,704 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-25 22:53:30,720 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6982 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6982))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6983)))) is different from true [2022-11-25 22:53:30,737 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6984) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6985)))) is different from true [2022-11-25 22:53:30,752 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6987) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:53:30,768 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6989))) (exists ((v_ArrVal_6988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6988)))) is different from true [2022-11-25 22:53:30,783 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6990))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6991) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:53:30,798 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6993) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6992)))) is different from true [2022-11-25 22:53:30,812 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6995))) (exists ((v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6994) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-25 22:53:30,827 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6996 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6996) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6997)))) is different from true [2022-11-25 22:53:30,841 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6999 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6999) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6998)))) is different from true [2022-11-25 22:53:30,855 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7001))) (exists ((v_ArrVal_7000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7000) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:53:30,869 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7003) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7002)))) is different from true [2022-11-25 22:53:30,884 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7005))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7004)))) is different from true [2022-11-25 22:53:30,898 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7006) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7007) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:53:30,913 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7009) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7008)))) is different from true [2022-11-25 22:53:30,929 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7010 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7010) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7011) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:53:30,942 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7012))) (exists ((v_ArrVal_7013 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7013) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:53:30,956 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7014))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7015 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7015) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 22:53:30,970 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7017))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7016)))) is different from true [2022-11-25 22:53:30,990 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7019))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7018)))) is different from true [2022-11-25 22:53:31,008 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7020) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7021)))) is different from true [2022-11-25 22:53:31,070 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:53:31,071 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-25 22:53:31,079 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-25 22:53:31,190 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:53:31,191 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-25 22:53:31,200 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-25 22:53:31,240 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-25 22:53:31,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:53:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 987 not checked. [2022-11-25 22:53:31,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:53:31,339 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7023 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-25 22:53:31,393 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_7022 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7023 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-25 22:53:32,427 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7115))) (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~mem39#1.base| v_ArrVal_7114) .cse0 v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7114) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-25 22:53:32,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562818114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:53:32,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:53:32,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 52, 52] total 135 [2022-11-25 22:53:32,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592480705] [2022-11-25 22:53:32,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:53:32,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-11-25 22:53:32,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:53:32,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-11-25 22:53:32,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=254, Unknown=141, NotChecked=20770, Total=21462 [2022-11-25 22:53:32,446 INFO L87 Difference]: Start difference. First operand 5079 states and 7435 transitions. Second operand has 136 states, 134 states have (on average 1.8134328358208955) internal successors, (243), 136 states have internal predecessors, (243), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 22:53:34,038 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5813))) (exists ((v_ArrVal_6374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6374))) (exists ((v_ArrVal_6938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6938))) (exists ((v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5824))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6939) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5819))) (exists ((v_ArrVal_5823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5823) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5828 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5828))) (exists ((v_ArrVal_5811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5811))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6943))) (exists ((v_ArrVal_6375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6375))) (exists ((v_ArrVal_5827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5827))) (exists ((v_ArrVal_5812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5812))) (exists ((v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6942)))) is different from true [2022-11-25 22:54:08,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:54:08,372 INFO L93 Difference]: Finished difference Result 13130 states and 20188 transitions. [2022-11-25 22:54:08,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 22:54:08,373 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 134 states have (on average 1.8134328358208955) internal successors, (243), 136 states have internal predecessors, (243), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2022-11-25 22:54:08,374 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-11-25 22:54:08,374 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 134 states have (on average 1.8134328358208955) internal successors, (243), 136 states have internal predecessors, (243), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122