./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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_96b0584d-381d-4653-b168-525aa98956d2/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 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f --- 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-26 00:22:55,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:22:55,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:22:55,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:22:55,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:22:55,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:22:55,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:22:55,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:22:55,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:22:55,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:22:55,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:22:55,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:22:55,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:22:55,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:22:55,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:22:55,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:22:55,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:22:55,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:22:55,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:22:55,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:22:55,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:22:55,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:22:55,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:22:55,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:22:55,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:22:55,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:22:55,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:22:55,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:22:55,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:22:55,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:22:55,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:22:55,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:22:55,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:22:55,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:22:55,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:22:55,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:22:55,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:22:55,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:22:55,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:22:55,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:22:55,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:22:55,910 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-26 00:22:55,960 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:22:55,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:22:55,961 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:22:55,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:22:55,962 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:22:55,963 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:22:55,963 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:22:55,964 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:22:55,964 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:22:55,964 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:22:55,965 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:22:55,966 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:22:55,966 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:22:55,966 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:22:55,966 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:22:55,967 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:22:55,967 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:22:55,967 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:22:55,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 00:22:55,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 00:22:55,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:22:55,969 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:22:55,969 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:22:55,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:22:55,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:22:55,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:22:55,970 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 00:22:55,971 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 00:22:55,971 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-26 00:22:55,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:22:55,971 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:22:55,972 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:22:55,972 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:22:55,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:22:55,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:22:55,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:22:55,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:22:55,973 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:22:55,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:22:55,974 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:22:55,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:22:55,974 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:22:55,974 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_96b0584d-381d-4653-b168-525aa98956d2/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_96b0584d-381d-4653-b168-525aa98956d2/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 -> 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f [2022-11-26 00:22:56,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:22:56,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:22:56,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:22:56,247 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:22:56,250 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:22:56,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2022-11-26 00:22:59,160 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:22:59,562 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:22:59,563 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2022-11-26 00:22:59,592 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/data/20be217a1/13c57dcca5dc47e084d9ff4d98e51837/FLAG1d96a9da4 [2022-11-26 00:22:59,609 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/data/20be217a1/13c57dcca5dc47e084d9ff4d98e51837 [2022-11-26 00:22:59,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:22:59,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:22:59,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:22:59,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:22:59,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:22:59,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:22:59" (1/1) ... [2022-11-26 00:22:59,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b111950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:22:59, skipping insertion in model container [2022-11-26 00:22:59,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:22:59" (1/1) ... [2022-11-26 00:22:59,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:22:59,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:23:00,379 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_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[44118,44131] [2022-11-26 00:23:00,396 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_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[44660,44673] [2022-11-26 00:23:00,401 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-26 00:23:00,562 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_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[56247,56260] [2022-11-26 00:23:00,563 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[56368,56381] [2022-11-26 00:23:00,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:23:00,596 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-26 00:23:00,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@119479ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:00, skipping insertion in model container [2022-11-26 00:23:00,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:23:00,597 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-26 00:23:00,599 INFO L158 Benchmark]: Toolchain (without parser) took 980.05ms. Allocated memory is still 159.4MB. Free memory was 126.1MB in the beginning and 104.4MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-26 00:23:00,601 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 111.1MB. Free memory is still 58.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:23:00,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 973.67ms. Allocated memory is still 159.4MB. Free memory was 126.1MB in the beginning and 104.4MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-26 00:23:00,604 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 111.1MB. Free memory is still 58.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 973.67ms. Allocated memory is still 159.4MB. Free memory was 126.1MB in the beginning and 104.4MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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_96b0584d-381d-4653-b168-525aa98956d2/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 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f --- 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-26 00:23:02,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:23:02,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:23:03,048 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:23:03,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:23:03,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:23:03,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:23:03,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:23:03,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:23:03,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:23:03,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:23:03,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:23:03,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:23:03,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:23:03,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:23:03,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:23:03,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:23:03,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:23:03,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:23:03,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:23:03,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:23:03,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:23:03,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:23:03,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:23:03,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:23:03,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:23:03,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:23:03,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:23:03,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:23:03,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:23:03,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:23:03,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:23:03,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:23:03,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:23:03,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:23:03,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:23:03,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:23:03,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:23:03,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:23:03,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:23:03,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:23:03,123 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-26 00:23:03,165 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:23:03,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:23:03,167 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:23:03,167 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:23:03,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:23:03,168 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:23:03,169 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:23:03,169 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:23:03,169 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:23:03,169 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:23:03,171 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:23:03,171 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:23:03,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 00:23:03,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 00:23:03,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:23:03,173 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:23:03,173 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:23:03,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:23:03,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:23:03,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:23:03,174 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 00:23:03,174 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 00:23:03,175 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-26 00:23:03,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:23:03,175 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:23:03,176 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-26 00:23:03,176 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-26 00:23:03,176 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:23:03,176 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:23:03,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:23:03,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-26 00:23:03,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:23:03,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:23:03,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:23:03,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:23:03,178 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-26 00:23:03,178 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-26 00:23:03,178 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:23:03,179 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-26 00:23:03,179 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_96b0584d-381d-4653-b168-525aa98956d2/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_96b0584d-381d-4653-b168-525aa98956d2/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 -> 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f [2022-11-26 00:23:03,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:23:03,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:23:03,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:23:03,600 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:23:03,600 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:23:03,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2022-11-26 00:23:06,797 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:23:07,208 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:23:07,217 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2022-11-26 00:23:07,235 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/data/2dda39184/36aa52a1d0e04b578ee2c0f4a300bde8/FLAG294160ae5 [2022-11-26 00:23:07,251 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/data/2dda39184/36aa52a1d0e04b578ee2c0f4a300bde8 [2022-11-26 00:23:07,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:23:07,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:23:07,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:23:07,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:23:07,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:23:07,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:23:07" (1/1) ... [2022-11-26 00:23:07,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6cab05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:07, skipping insertion in model container [2022-11-26 00:23:07,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:23:07" (1/1) ... [2022-11-26 00:23:07,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:23:07,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:23:07,912 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_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[44118,44131] [2022-11-26 00:23:07,925 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_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[44660,44673] [2022-11-26 00:23:07,928 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-26 00:23:08,093 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_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[56247,56260] [2022-11-26 00:23:08,100 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[56368,56381] [2022-11-26 00:23:08,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:23:08,144 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-26 00:23:08,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:23:08,201 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_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[44118,44131] [2022-11-26 00:23:08,217 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_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[44660,44673] [2022-11-26 00:23:08,231 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-26 00:23:08,302 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_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[56247,56260] [2022-11-26 00:23:08,312 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_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[56368,56381] [2022-11-26 00:23:08,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:23:08,336 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:23:08,390 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_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[44118,44131] [2022-11-26 00:23:08,400 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_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[44660,44673] [2022-11-26 00:23:08,402 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-26 00:23:08,497 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_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[56247,56260] [2022-11-26 00:23:08,498 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_96b0584d-381d-4653-b168-525aa98956d2/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i[56368,56381] [2022-11-26 00:23:08,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:23:08,572 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:23:08,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08 WrapperNode [2022-11-26 00:23:08,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:23:08,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:23:08,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:23:08,575 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:23:08,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,666 INFO L138 Inliner]: procedures = 285, calls = 294, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1038 [2022-11-26 00:23:08,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:23:08,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:23:08,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:23:08,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:23:08,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,770 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:23:08,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:23:08,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:23:08,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:23:08,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:23:08,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:23:08,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:23:08,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:23:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-26 00:23:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-26 00:23:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:23:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-26 00:23:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 00:23:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:23:08,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-26 00:23:08,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-26 00:23:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2022-11-26 00:23:08,924 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2022-11-26 00:23:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-26 00:23:08,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-26 00:23:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:23:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:23:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2022-11-26 00:23:08,926 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2022-11-26 00:23:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 00:23:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2022-11-26 00:23:08,927 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2022-11-26 00:23:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:23:08,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:23:09,250 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:23:09,253 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:23:14,374 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:23:14,388 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:23:14,388 INFO L300 CfgBuilder]: Removed 63 assume(true) statements. [2022-11-26 00:23:14,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:23:14 BoogieIcfgContainer [2022-11-26 00:23:14,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:23:14,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:23:14,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:23:14,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:23:14,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:23:07" (1/3) ... [2022-11-26 00:23:14,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41688179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:23:14, skipping insertion in model container [2022-11-26 00:23:14,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (2/3) ... [2022-11-26 00:23:14,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41688179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:23:14, skipping insertion in model container [2022-11-26 00:23:14,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:23:14" (3/3) ... [2022-11-26 00:23:14,400 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test6-1.i [2022-11-26 00:23:14,420 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:23:14,420 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 531 error locations. [2022-11-26 00:23:14,509 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:23:14,516 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;@30e2b67d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:23:14,517 INFO L358 AbstractCegarLoop]: Starting to check reachability of 531 error locations. [2022-11-26 00:23:14,529 INFO L276 IsEmpty]: Start isEmpty. Operand has 1082 states, 533 states have (on average 2.2288930581613506) internal successors, (1188), 1064 states have internal predecessors, (1188), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-26 00:23:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:23:14,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:14,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:23:14,537 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:23:14,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2022-11-26 00:23:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:23:14,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016610001] [2022-11-26 00:23:14,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:14,559 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-26 00:23:14,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:23:14,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:14,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:14,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:23:14,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:14,821 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-26 00:23:14,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-26 00:23:14,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:23:14,835 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:23:14,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016610001] [2022-11-26 00:23:14,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016610001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:14,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:14,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:23:14,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671377762] [2022-11-26 00:23:14,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:14,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:23:14,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:23:14,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:23:14,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:23:14,877 INFO L87 Difference]: Start difference. First operand has 1082 states, 533 states have (on average 2.2288930581613506) internal successors, (1188), 1064 states have internal predecessors, (1188), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:17,171 INFO L93 Difference]: Finished difference Result 1161 states and 1227 transitions. [2022-11-26 00:23:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:23:17,174 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-26 00:23:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:17,191 INFO L225 Difference]: With dead ends: 1161 [2022-11-26 00:23:17,191 INFO L226 Difference]: Without dead ends: 1159 [2022-11-26 00:23:17,193 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-26 00:23:17,196 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 714 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:17,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1040 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-26 00:23:17,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-11-26 00:23:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1102. [2022-11-26 00:23:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 567 states have (on average 2.0846560846560847) internal successors, (1182), 1085 states have internal predecessors, (1182), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:23:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1208 transitions. [2022-11-26 00:23:17,308 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1208 transitions. Word has length 3 [2022-11-26 00:23:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:17,308 INFO L495 AbstractCegarLoop]: Abstraction has 1102 states and 1208 transitions. [2022-11-26 00:23:17,308 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-26 00:23:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1208 transitions. [2022-11-26 00:23:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:23:17,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:17,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:23:17,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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)] Forceful destruction successful, exit code 0 [2022-11-26 00:23:17,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:17,519 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:23:17,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:17,520 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2022-11-26 00:23:17,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:23:17,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229540762] [2022-11-26 00:23:17,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:17,521 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-26 00:23:17,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:23:17,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:17,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:17,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:23:17,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:17,679 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-26 00:23:17,692 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-26 00:23:17,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:23:17,693 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:23:17,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229540762] [2022-11-26 00:23:17,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229540762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:17,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:17,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:23:17,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064213234] [2022-11-26 00:23:17,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:17,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:23:17,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:23:17,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:23:17,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:23:17,698 INFO L87 Difference]: Start difference. First operand 1102 states and 1208 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:21,266 INFO L93 Difference]: Finished difference Result 1496 states and 1636 transitions. [2022-11-26 00:23:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:23:21,267 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-26 00:23:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:21,272 INFO L225 Difference]: With dead ends: 1496 [2022-11-26 00:23:21,273 INFO L226 Difference]: Without dead ends: 1496 [2022-11-26 00:23:21,273 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-26 00:23:21,274 INFO L413 NwaCegarLoop]: 941 mSDtfsCounter, 418 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:21,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1534 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-26 00:23:21,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2022-11-26 00:23:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1306. [2022-11-26 00:23:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 770 states have (on average 2.07012987012987) internal successors, (1594), 1287 states have internal predecessors, (1594), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-26 00:23:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1624 transitions. [2022-11-26 00:23:21,317 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1624 transitions. Word has length 3 [2022-11-26 00:23:21,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:21,317 INFO L495 AbstractCegarLoop]: Abstraction has 1306 states and 1624 transitions. [2022-11-26 00:23:21,317 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-26 00:23:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1624 transitions. [2022-11-26 00:23:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:23:21,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:21,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:23:21,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:21,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:21,530 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:23:21,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:21,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2022-11-26 00:23:21,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:23:21,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234460001] [2022-11-26 00:23:21,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:21,531 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-26 00:23:21,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:23:21,533 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:21,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:21,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:23:21,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:21,750 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-26 00:23:21,756 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-26 00:23:21,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:23:21,855 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-26 00:23:21,880 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:23:21,881 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-26 00:23:21,919 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-26 00:23:21,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:23:21,920 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:23:21,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234460001] [2022-11-26 00:23:21,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234460001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:21,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:21,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:23:21,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636887851] [2022-11-26 00:23:21,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:21,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:23:21,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:23:21,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:23:21,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:23:21,923 INFO L87 Difference]: Start difference. First operand 1306 states and 1624 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:28,004 INFO L93 Difference]: Finished difference Result 1996 states and 2369 transitions. [2022-11-26 00:23:28,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:23:28,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-26 00:23:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:28,014 INFO L225 Difference]: With dead ends: 1996 [2022-11-26 00:23:28,015 INFO L226 Difference]: Without dead ends: 1996 [2022-11-26 00:23:28,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:23:28,016 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 718 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:28,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1581 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-11-26 00:23:28,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2022-11-26 00:23:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1451. [2022-11-26 00:23:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 915 states have (on average 2.0513661202185793) internal successors, (1877), 1432 states have internal predecessors, (1877), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-26 00:23:28,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1907 transitions. [2022-11-26 00:23:28,054 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1907 transitions. Word has length 8 [2022-11-26 00:23:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:28,055 INFO L495 AbstractCegarLoop]: Abstraction has 1451 states and 1907 transitions. [2022-11-26 00:23:28,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1907 transitions. [2022-11-26 00:23:28,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:23:28,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:28,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:23:28,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:28,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:28,268 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:23:28,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:28,269 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2022-11-26 00:23:28,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:23:28,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698428374] [2022-11-26 00:23:28,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:28,270 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-26 00:23:28,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:23:28,272 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:28,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:28,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:23:28,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:28,449 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-26 00:23:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:23:28,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:23:28,479 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:23:28,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698428374] [2022-11-26 00:23:28,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698428374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:28,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:28,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:23:28,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878140260] [2022-11-26 00:23:28,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:28,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:23:28,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:23:28,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:23:28,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:23:28,492 INFO L87 Difference]: Start difference. First operand 1451 states and 1907 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:32,326 INFO L93 Difference]: Finished difference Result 2429 states and 3105 transitions. [2022-11-26 00:23:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:23:32,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:23:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:32,337 INFO L225 Difference]: With dead ends: 2429 [2022-11-26 00:23:32,337 INFO L226 Difference]: Without dead ends: 2429 [2022-11-26 00:23:32,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:23:32,338 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 2139 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:32,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 1969 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-26 00:23:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2022-11-26 00:23:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 1406. [2022-11-26 00:23:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 915 states have (on average 1.9868852459016393) internal successors, (1818), 1387 states have internal predecessors, (1818), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-26 00:23:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1848 transitions. [2022-11-26 00:23:32,377 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1848 transitions. Word has length 9 [2022-11-26 00:23:32,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:32,378 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 1848 transitions. [2022-11-26 00:23:32,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1848 transitions. [2022-11-26 00:23:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:23:32,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:32,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:23:32,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:32,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:32,591 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:23:32,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:32,592 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2022-11-26 00:23:32,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:23:32,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213143021] [2022-11-26 00:23:32,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:32,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:23:32,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:23:32,594 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:32,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:32,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:23:32,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:32,790 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-26 00:23:32,857 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-26 00:23:32,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:23:32,859 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:23:32,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213143021] [2022-11-26 00:23:32,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213143021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:32,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:32,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:23:32,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616964553] [2022-11-26 00:23:32,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:32,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:23:32,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:23:32,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:23:32,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:23:32,861 INFO L87 Difference]: Start difference. First operand 1406 states and 1848 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:37,336 INFO L93 Difference]: Finished difference Result 2045 states and 2683 transitions. [2022-11-26 00:23:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:23:37,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:23:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:37,343 INFO L225 Difference]: With dead ends: 2045 [2022-11-26 00:23:37,344 INFO L226 Difference]: Without dead ends: 2045 [2022-11-26 00:23:37,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:23:37,345 INFO L413 NwaCegarLoop]: 1191 mSDtfsCounter, 1375 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:37,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 2090 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-26 00:23:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2022-11-26 00:23:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1396. [2022-11-26 00:23:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 915 states have (on average 1.960655737704918) internal successors, (1794), 1377 states have internal predecessors, (1794), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-26 00:23:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1824 transitions. [2022-11-26 00:23:37,388 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1824 transitions. Word has length 9 [2022-11-26 00:23:37,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:37,388 INFO L495 AbstractCegarLoop]: Abstraction has 1396 states and 1824 transitions. [2022-11-26 00:23:37,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1824 transitions. [2022-11-26 00:23:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:23:37,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:37,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:23:37,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:37,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:37,601 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr516ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:23:37,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:37,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1033799265, now seen corresponding path program 1 times [2022-11-26 00:23:37,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:23:37,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769263085] [2022-11-26 00:23:37,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:37,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-26 00:23:37,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:23:37,604 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:37,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:37,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:23:37,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:37,856 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-26 00:23:37,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:23:37,858 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:23:37,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769263085] [2022-11-26 00:23:37,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769263085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:37,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:37,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:23:37,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709512578] [2022-11-26 00:23:37,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:37,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:23:37,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:23:37,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:23:37,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:23:37,860 INFO L87 Difference]: Start difference. First operand 1396 states and 1824 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:38,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:38,706 INFO L93 Difference]: Finished difference Result 1872 states and 2391 transitions. [2022-11-26 00:23:38,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:23:38,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-26 00:23:38,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:38,713 INFO L225 Difference]: With dead ends: 1872 [2022-11-26 00:23:38,713 INFO L226 Difference]: Without dead ends: 1872 [2022-11-26 00:23:38,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:23:38,714 INFO L413 NwaCegarLoop]: 1154 mSDtfsCounter, 546 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 3116 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:38,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 3116 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-26 00:23:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2022-11-26 00:23:38,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1647. [2022-11-26 00:23:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1166 states have (on average 1.9742710120068612) internal successors, (2302), 1628 states have internal predecessors, (2302), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-26 00:23:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2332 transitions. [2022-11-26 00:23:38,751 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2332 transitions. Word has length 11 [2022-11-26 00:23:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:38,751 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 2332 transitions. [2022-11-26 00:23:38,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2332 transitions. [2022-11-26 00:23:38,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:23:38,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:38,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:23:38,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:38,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:38,965 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:23:38,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:38,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1297880888, now seen corresponding path program 1 times [2022-11-26 00:23:38,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:23:38,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560089302] [2022-11-26 00:23:38,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:38,966 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-26 00:23:38,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:23:38,968 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:39,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:39,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:23:39,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:39,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:23:39,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:23:39,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:23:39,205 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-26 00:23:39,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:23:39,285 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-26 00:23:39,306 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-26 00:23:39,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:23:39,306 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:23:39,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560089302] [2022-11-26 00:23:39,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560089302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:39,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:39,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:23:39,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741377220] [2022-11-26 00:23:39,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:39,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:23:39,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:23:39,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:23:39,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:23:39,309 INFO L87 Difference]: Start difference. First operand 1647 states and 2332 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:41,192 INFO L93 Difference]: Finished difference Result 1653 states and 2035 transitions. [2022-11-26 00:23:41,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:23:41,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-26 00:23:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:41,199 INFO L225 Difference]: With dead ends: 1653 [2022-11-26 00:23:41,199 INFO L226 Difference]: Without dead ends: 1653 [2022-11-26 00:23:41,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:23:41,200 INFO L413 NwaCegarLoop]: 1038 mSDtfsCounter, 358 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:41,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 2971 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-26 00:23:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-11-26 00:23:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1289. [2022-11-26 00:23:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 810 states have (on average 1.9506172839506173) internal successors, (1580), 1272 states have internal predecessors, (1580), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:23:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1606 transitions. [2022-11-26 00:23:41,228 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1606 transitions. Word has length 14 [2022-11-26 00:23:41,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:41,228 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1606 transitions. [2022-11-26 00:23:41,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1606 transitions. [2022-11-26 00:23:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:23:41,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:41,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:23:41,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:41,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:41,442 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:23:41,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2022-11-26 00:23:41,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:23:41,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208278035] [2022-11-26 00:23:41,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:41,443 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-26 00:23:41,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:23:41,444 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:41,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:41,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 00:23:41,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:41,675 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-26 00:23:41,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:23:41,675 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:23:41,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208278035] [2022-11-26 00:23:41,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208278035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:41,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:41,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:23:41,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872446914] [2022-11-26 00:23:41,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:41,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:23:41,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:23:41,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:23:41,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:23:41,678 INFO L87 Difference]: Start difference. First operand 1289 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:41,709 INFO L93 Difference]: Finished difference Result 1229 states and 1520 transitions. [2022-11-26 00:23:41,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:23:41,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-26 00:23:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:41,713 INFO L225 Difference]: With dead ends: 1229 [2022-11-26 00:23:41,714 INFO L226 Difference]: Without dead ends: 1229 [2022-11-26 00:23:41,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:23:41,715 INFO L413 NwaCegarLoop]: 1027 mSDtfsCounter, 957 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:41,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 1094 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:23:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2022-11-26 00:23:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1229. [2022-11-26 00:23:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 774 states have (on average 1.930232558139535) internal successors, (1494), 1212 states have internal predecessors, (1494), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:23:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1520 transitions. [2022-11-26 00:23:41,745 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1520 transitions. Word has length 19 [2022-11-26 00:23:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:41,745 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 1520 transitions. [2022-11-26 00:23:41,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1520 transitions. [2022-11-26 00:23:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:23:41,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:41,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:23:41,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:41,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:41,959 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:23:41,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2022-11-26 00:23:41,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:23:41,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540293408] [2022-11-26 00:23:41,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:41,960 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-26 00:23:41,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:23:41,961 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:41,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:42,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:23:42,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:42,188 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-26 00:23:42,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:23:42,189 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:23:42,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540293408] [2022-11-26 00:23:42,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540293408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:42,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:42,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:23:42,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028459694] [2022-11-26 00:23:42,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:42,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:23:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:23:42,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:23:42,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:23:42,191 INFO L87 Difference]: Start difference. First operand 1229 states and 1520 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:42,272 INFO L93 Difference]: Finished difference Result 1201 states and 1464 transitions. [2022-11-26 00:23:42,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:23:42,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-26 00:23:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:42,276 INFO L225 Difference]: With dead ends: 1201 [2022-11-26 00:23:42,276 INFO L226 Difference]: Without dead ends: 1201 [2022-11-26 00:23:42,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:23:42,277 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 938 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:42,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 2024 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:23:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-11-26 00:23:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1199. [2022-11-26 00:23:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 758 states have (on average 1.8944591029023747) internal successors, (1436), 1182 states have internal predecessors, (1436), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:23:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1462 transitions. [2022-11-26 00:23:42,300 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1462 transitions. Word has length 21 [2022-11-26 00:23:42,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:42,301 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1462 transitions. [2022-11-26 00:23:42,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:42,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1462 transitions. [2022-11-26 00:23:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 00:23:42,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:42,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:23:42,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:42,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:42,515 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:23:42,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2022-11-26 00:23:42,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:23:42,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677154622] [2022-11-26 00:23:42,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:42,517 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-26 00:23:42,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:23:42,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:42,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:42,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:23:42,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:42,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-26 00:23:42,854 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-26 00:23:42,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:23:42,855 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:23:42,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677154622] [2022-11-26 00:23:42,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677154622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:42,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:42,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:23:42,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937428205] [2022-11-26 00:23:42,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:42,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:23:42,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:23:42,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:23:42,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:23:42,857 INFO L87 Difference]: Start difference. First operand 1199 states and 1462 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:47,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:47,184 INFO L93 Difference]: Finished difference Result 2183 states and 2663 transitions. [2022-11-26 00:23:47,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:23:47,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-26 00:23:47,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:47,189 INFO L225 Difference]: With dead ends: 2183 [2022-11-26 00:23:47,190 INFO L226 Difference]: Without dead ends: 2183 [2022-11-26 00:23:47,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:23:47,191 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 2036 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:47,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2039 Valid, 2017 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-26 00:23:47,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2022-11-26 00:23:47,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1195. [2022-11-26 00:23:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 758 states have (on average 1.883905013192612) internal successors, (1428), 1178 states have internal predecessors, (1428), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:23:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1454 transitions. [2022-11-26 00:23:47,215 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1454 transitions. Word has length 35 [2022-11-26 00:23:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:47,215 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1454 transitions. [2022-11-26 00:23:47,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1454 transitions. [2022-11-26 00:23:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 00:23:47,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:47,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:23:47,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:47,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:47,429 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:23:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2022-11-26 00:23:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:23:47,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616940694] [2022-11-26 00:23:47,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:47,431 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-26 00:23:47,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:23:47,432 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:47,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:47,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 00:23:47,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:47,671 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-26 00:23:47,900 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-26 00:23:47,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:23:47,900 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:23:47,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616940694] [2022-11-26 00:23:47,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616940694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:47,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:47,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:23:47,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971232399] [2022-11-26 00:23:47,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:47,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:23:47,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:23:47,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:23:47,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:23:47,902 INFO L87 Difference]: Start difference. First operand 1195 states and 1454 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:52,999 INFO L93 Difference]: Finished difference Result 1805 states and 2217 transitions. [2022-11-26 00:23:52,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:23:52,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-26 00:23:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:53,007 INFO L225 Difference]: With dead ends: 1805 [2022-11-26 00:23:53,007 INFO L226 Difference]: Without dead ends: 1805 [2022-11-26 00:23:53,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:23:53,008 INFO L413 NwaCegarLoop]: 1229 mSDtfsCounter, 1783 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:53,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 2579 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-26 00:23:53,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-11-26 00:23:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1191. [2022-11-26 00:23:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 758 states have (on average 1.8733509234828496) internal successors, (1420), 1174 states have internal predecessors, (1420), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:23:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1446 transitions. [2022-11-26 00:23:53,042 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1446 transitions. Word has length 35 [2022-11-26 00:23:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:53,043 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1446 transitions. [2022-11-26 00:23:53,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:53,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1446 transitions. [2022-11-26 00:23:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-26 00:23:53,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:53,045 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-26 00:23:53,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:53,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:53,257 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:23:53,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:53,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2063932984, now seen corresponding path program 1 times [2022-11-26 00:23:53,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:23:53,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141608189] [2022-11-26 00:23:53,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:53,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-26 00:23:53,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:23:53,259 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:53,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:53,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:23:53,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:53,586 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-26 00:23:53,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:23:53,587 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:23:53,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141608189] [2022-11-26 00:23:53,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141608189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:53,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:53,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:23:53,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65482940] [2022-11-26 00:23:53,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:53,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:23:53,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:23:53,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:23:53,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:23:53,590 INFO L87 Difference]: Start difference. First operand 1191 states and 1446 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:53,656 INFO L93 Difference]: Finished difference Result 1179 states and 1426 transitions. [2022-11-26 00:23:53,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:23:53,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-11-26 00:23:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:53,664 INFO L225 Difference]: With dead ends: 1179 [2022-11-26 00:23:53,664 INFO L226 Difference]: Without dead ends: 1179 [2022-11-26 00:23:53,664 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-26 00:23:53,665 INFO L413 NwaCegarLoop]: 976 mSDtfsCounter, 907 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:53,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 2002 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:23:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-11-26 00:23:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2022-11-26 00:23:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 746 states have (on average 1.876675603217158) internal successors, (1400), 1162 states have internal predecessors, (1400), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:23:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1426 transitions. [2022-11-26 00:23:53,684 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1426 transitions. Word has length 54 [2022-11-26 00:23:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:53,685 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1426 transitions. [2022-11-26 00:23:53,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1426 transitions. [2022-11-26 00:23:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-26 00:23:53,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:53,690 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-26 00:23:53,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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)] Ended with exit code 0 [2022-11-26 00:23:53,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:53,904 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:23:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash -203146628, now seen corresponding path program 1 times [2022-11-26 00:23:53,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:23:53,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970971173] [2022-11-26 00:23:53,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:53,905 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-26 00:23:53,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:23:53,906 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:53,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:54,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 00:23:54,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:54,440 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:23:54,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 24 [2022-11-26 00:23:54,519 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:23:54,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-26 00:23:55,019 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-26 00:23:55,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:23:55,020 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:23:55,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970971173] [2022-11-26 00:23:55,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970971173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:55,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:55,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:23:55,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750849795] [2022-11-26 00:23:55,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:55,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:23:55,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:23:55,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:23:55,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:23:55,022 INFO L87 Difference]: Start difference. First operand 1179 states and 1426 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:59,344 INFO L93 Difference]: Finished difference Result 2639 states and 3164 transitions. [2022-11-26 00:23:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:23:59,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-26 00:23:59,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:59,352 INFO L225 Difference]: With dead ends: 2639 [2022-11-26 00:23:59,352 INFO L226 Difference]: Without dead ends: 2639 [2022-11-26 00:23:59,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:23:59,353 INFO L413 NwaCegarLoop]: 881 mSDtfsCounter, 3028 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3028 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:59,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3028 Valid, 1820 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-26 00:23:59,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2022-11-26 00:23:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 1615. [2022-11-26 00:23:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1167 states have (on average 1.8723221936589547) internal successors, (2185), 1586 states have internal predecessors, (2185), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-26 00:23:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2235 transitions. [2022-11-26 00:23:59,385 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2235 transitions. Word has length 62 [2022-11-26 00:23:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:59,386 INFO L495 AbstractCegarLoop]: Abstraction has 1615 states and 2235 transitions. [2022-11-26 00:23:59,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2235 transitions. [2022-11-26 00:23:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-26 00:23:59,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:59,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] [2022-11-26 00:23:59,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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)] Ended with exit code 0 [2022-11-26 00:23:59,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:59,602 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:23:59,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:59,603 INFO L85 PathProgramCache]: Analyzing trace with hash -203146627, now seen corresponding path program 1 times [2022-11-26 00:23:59,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:23:59,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907271137] [2022-11-26 00:23:59,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:59,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-26 00:23:59,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:23:59,605 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:59,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:23:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:00,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-26 00:24:00,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:00,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:00,060 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-26 00:24:00,137 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:24:00,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-26 00:24:00,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-26 00:24:00,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:00,895 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:00,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907271137] [2022-11-26 00:24:00,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907271137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:00,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:00,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:24:00,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96548699] [2022-11-26 00:24:00,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:00,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:24:00,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:00,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:24:00,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:24:00,897 INFO L87 Difference]: Start difference. First operand 1615 states and 2235 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:05,601 INFO L93 Difference]: Finished difference Result 1621 states and 2242 transitions. [2022-11-26 00:24:05,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:24:05,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-26 00:24:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:05,608 INFO L225 Difference]: With dead ends: 1621 [2022-11-26 00:24:05,608 INFO L226 Difference]: Without dead ends: 1621 [2022-11-26 00:24:05,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:24:05,609 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 111 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:05,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 2283 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-26 00:24:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-11-26 00:24:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1620. [2022-11-26 00:24:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1171 states have (on average 1.8693424423569598) internal successors, (2189), 1590 states have internal predecessors, (2189), 26 states have call successors, (26), 9 states have call predecessors, (26), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-26 00:24:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2241 transitions. [2022-11-26 00:24:05,637 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2241 transitions. Word has length 62 [2022-11-26 00:24:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:05,637 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 2241 transitions. [2022-11-26 00:24:05,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2241 transitions. [2022-11-26 00:24:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-26 00:24:05,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:05,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:05,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:05,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:05,854 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:05,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:05,855 INFO L85 PathProgramCache]: Analyzing trace with hash 389814229, now seen corresponding path program 1 times [2022-11-26 00:24:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:05,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619014083] [2022-11-26 00:24:05,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:05,856 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-26 00:24:05,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:05,857 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:05,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:06,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:24:06,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:06,244 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-26 00:24:06,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:06,244 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:06,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619014083] [2022-11-26 00:24:06,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619014083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:06,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:06,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:24:06,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848471860] [2022-11-26 00:24:06,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:06,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:24:06,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:06,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:24:06,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:24:06,247 INFO L87 Difference]: Start difference. First operand 1620 states and 2241 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:06,373 INFO L93 Difference]: Finished difference Result 1646 states and 2268 transitions. [2022-11-26 00:24:06,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:24:06,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-26 00:24:06,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:06,379 INFO L225 Difference]: With dead ends: 1646 [2022-11-26 00:24:06,379 INFO L226 Difference]: Without dead ends: 1646 [2022-11-26 00:24:06,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:24:06,380 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 19 mSDsluCounter, 3882 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4855 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:06,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4855 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:24:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-11-26 00:24:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1644. [2022-11-26 00:24:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1189 states have (on average 1.8603868797308662) internal successors, (2212), 1610 states have internal predecessors, (2212), 28 states have call successors, (28), 13 states have call predecessors, (28), 11 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-26 00:24:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2268 transitions. [2022-11-26 00:24:06,412 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2268 transitions. Word has length 68 [2022-11-26 00:24:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:06,413 INFO L495 AbstractCegarLoop]: Abstraction has 1644 states and 2268 transitions. [2022-11-26 00:24:06,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2268 transitions. [2022-11-26 00:24:06,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-26 00:24:06,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:06,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:06,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:06,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:06,628 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:06,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:06,629 INFO L85 PathProgramCache]: Analyzing trace with hash 341176989, now seen corresponding path program 1 times [2022-11-26 00:24:06,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:06,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125054472] [2022-11-26 00:24:06,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:06,630 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-26 00:24:06,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:06,631 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:06,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:06,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:24:07,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:07,200 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-26 00:24:07,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:07,200 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:07,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125054472] [2022-11-26 00:24:07,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125054472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:07,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:07,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:24:07,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475049183] [2022-11-26 00:24:07,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:07,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:24:07,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:07,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:24:07,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:24:07,203 INFO L87 Difference]: Start difference. First operand 1644 states and 2268 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:24:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:07,427 INFO L93 Difference]: Finished difference Result 1656 states and 2282 transitions. [2022-11-26 00:24:07,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:24:07,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-11-26 00:24:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:07,434 INFO L225 Difference]: With dead ends: 1656 [2022-11-26 00:24:07,434 INFO L226 Difference]: Without dead ends: 1656 [2022-11-26 00:24:07,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:24:07,435 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 20 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3777 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:07,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3777 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:24:07,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-11-26 00:24:07,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1647. [2022-11-26 00:24:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1191 states have (on average 1.858942065491184) internal successors, (2214), 1612 states have internal predecessors, (2214), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-26 00:24:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2271 transitions. [2022-11-26 00:24:07,465 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2271 transitions. Word has length 68 [2022-11-26 00:24:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:07,465 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 2271 transitions. [2022-11-26 00:24:07,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:24:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2271 transitions. [2022-11-26 00:24:07,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-26 00:24:07,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:07,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:07,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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)] Ended with exit code 0 [2022-11-26 00:24:07,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:07,681 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:07,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:07,682 INFO L85 PathProgramCache]: Analyzing trace with hash -233122725, now seen corresponding path program 1 times [2022-11-26 00:24:07,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:07,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835670801] [2022-11-26 00:24:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:07,683 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-26 00:24:07,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:07,684 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:07,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:08,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:24:08,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:08,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-26 00:24:08,330 WARN L859 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)))) is different from true [2022-11-26 00:24:08,351 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:24:08,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-26 00:24:08,364 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-26 00:24:08,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:08,365 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:08,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835670801] [2022-11-26 00:24:08,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835670801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:08,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:08,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:24:08,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985273662] [2022-11-26 00:24:08,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:08,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:24:08,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:08,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:24:08,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2022-11-26 00:24:08,367 INFO L87 Difference]: Start difference. First operand 1647 states and 2271 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:24:13,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:13,256 INFO L93 Difference]: Finished difference Result 2769 states and 3749 transitions. [2022-11-26 00:24:13,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:24:13,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2022-11-26 00:24:13,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:13,264 INFO L225 Difference]: With dead ends: 2769 [2022-11-26 00:24:13,265 INFO L226 Difference]: Without dead ends: 2769 [2022-11-26 00:24:13,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2022-11-26 00:24:13,266 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 1428 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 4034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1894 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:13,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 2219 Invalid, 4034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2121 Invalid, 0 Unknown, 1894 Unchecked, 4.8s Time] [2022-11-26 00:24:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2022-11-26 00:24:13,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1646. [2022-11-26 00:24:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1191 states have (on average 1.8572628043660788) internal successors, (2212), 1611 states have internal predecessors, (2212), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-26 00:24:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2269 transitions. [2022-11-26 00:24:13,300 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2269 transitions. Word has length 73 [2022-11-26 00:24:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:13,300 INFO L495 AbstractCegarLoop]: Abstraction has 1646 states and 2269 transitions. [2022-11-26 00:24:13,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:24:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2269 transitions. [2022-11-26 00:24:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-26 00:24:13,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:13,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:13,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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)] Forceful destruction successful, exit code 0 [2022-11-26 00:24:13,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:13,517 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:13,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:13,518 INFO L85 PathProgramCache]: Analyzing trace with hash -233122724, now seen corresponding path program 1 times [2022-11-26 00:24:13,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:13,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115635671] [2022-11-26 00:24:13,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:13,519 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-26 00:24:13,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:13,520 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:13,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:14,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-26 00:24:14,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:14,054 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-26 00:24:14,062 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-26 00:24:14,635 WARN L859 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_1107 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |alt_malloc_#res.base| v_ArrVal_1107))) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2022-11-26 00:24:14,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:14,656 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-26 00:24:14,668 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:24:14,668 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-26 00:24:14,691 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-26 00:24:14,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:14,691 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:14,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115635671] [2022-11-26 00:24:14,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115635671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:14,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:14,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:24:14,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126904677] [2022-11-26 00:24:14,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:14,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:24:14,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:14,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:24:14,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2022-11-26 00:24:14,693 INFO L87 Difference]: Start difference. First operand 1646 states and 2269 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:24:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:22,592 INFO L93 Difference]: Finished difference Result 2840 states and 3874 transitions. [2022-11-26 00:24:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:24:22,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2022-11-26 00:24:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:22,601 INFO L225 Difference]: With dead ends: 2840 [2022-11-26 00:24:22,602 INFO L226 Difference]: Without dead ends: 2840 [2022-11-26 00:24:22,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2022-11-26 00:24:22,603 INFO L413 NwaCegarLoop]: 1040 mSDtfsCounter, 2151 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 3092 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2157 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 5020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1900 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:22,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2157 Valid, 2397 Invalid, 5020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3092 Invalid, 0 Unknown, 1900 Unchecked, 7.8s Time] [2022-11-26 00:24:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2022-11-26 00:24:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 1642. [2022-11-26 00:24:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1195 states have (on average 1.8410041841004183) internal successors, (2200), 1607 states have internal predecessors, (2200), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-26 00:24:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2257 transitions. [2022-11-26 00:24:22,637 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2257 transitions. Word has length 73 [2022-11-26 00:24:22,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:22,637 INFO L495 AbstractCegarLoop]: Abstraction has 1642 states and 2257 transitions. [2022-11-26 00:24:22,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:24:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2257 transitions. [2022-11-26 00:24:22,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-26 00:24:22,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:22,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:22,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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)] Ended with exit code 0 [2022-11-26 00:24:22,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:22,854 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:22,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:22,854 INFO L85 PathProgramCache]: Analyzing trace with hash -159183299, now seen corresponding path program 1 times [2022-11-26 00:24:22,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:22,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155482940] [2022-11-26 00:24:22,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:22,855 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-26 00:24:22,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:22,856 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:22,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:23,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-26 00:24:23,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:23,269 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-26 00:24:23,292 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-26 00:24:23,320 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-26 00:24:23,369 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-26 00:24:23,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:23,369 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:23,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155482940] [2022-11-26 00:24:23,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155482940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:23,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:23,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 00:24:23,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650758390] [2022-11-26 00:24:23,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:23,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 00:24:23,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:23,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 00:24:23,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:24:23,371 INFO L87 Difference]: Start difference. First operand 1642 states and 2257 transitions. Second operand has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 00:24:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:28,282 INFO L93 Difference]: Finished difference Result 1657 states and 2273 transitions. [2022-11-26 00:24:28,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:24:28,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2022-11-26 00:24:28,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:28,299 INFO L225 Difference]: With dead ends: 1657 [2022-11-26 00:24:28,300 INFO L226 Difference]: Without dead ends: 1657 [2022-11-26 00:24:28,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-26 00:24:28,301 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 23 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4068 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:28,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4068 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-26 00:24:28,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2022-11-26 00:24:28,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1656. [2022-11-26 00:24:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1207 states have (on average 1.835956917978459) internal successors, (2216), 1619 states have internal predecessors, (2216), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-26 00:24:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2273 transitions. [2022-11-26 00:24:28,329 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2273 transitions. Word has length 80 [2022-11-26 00:24:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:28,330 INFO L495 AbstractCegarLoop]: Abstraction has 1656 states and 2273 transitions. [2022-11-26 00:24:28,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 00:24:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2273 transitions. [2022-11-26 00:24:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-26 00:24:28,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:28,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:28,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:28,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:28,546 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:28,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:28,546 INFO L85 PathProgramCache]: Analyzing trace with hash -639714905, now seen corresponding path program 1 times [2022-11-26 00:24:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:28,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087786094] [2022-11-26 00:24:28,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:28,548 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-26 00:24:28,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:28,549 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:28,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:28,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-26 00:24:28,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:28,971 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-26 00:24:29,016 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-26 00:24:29,025 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-26 00:24:29,082 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-26 00:24:29,089 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-26 00:24:29,188 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-26 00:24:29,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:29,188 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:29,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087786094] [2022-11-26 00:24:29,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087786094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:29,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:29,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-26 00:24:29,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988778450] [2022-11-26 00:24:29,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:29,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 00:24:29,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:29,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 00:24:29,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-26 00:24:29,191 INFO L87 Difference]: Start difference. First operand 1656 states and 2273 transitions. Second operand has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:24:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:36,080 INFO L93 Difference]: Finished difference Result 1656 states and 2271 transitions. [2022-11-26 00:24:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:24:36,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2022-11-26 00:24:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:36,086 INFO L225 Difference]: With dead ends: 1656 [2022-11-26 00:24:36,086 INFO L226 Difference]: Without dead ends: 1656 [2022-11-26 00:24:36,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:24:36,087 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 19 mSDsluCounter, 3910 mSDsCounter, 0 mSdLazyCounter, 2866 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4864 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:36,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4864 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2866 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-11-26 00:24:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-11-26 00:24:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2022-11-26 00:24:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1207 states have (on average 1.8342999171499585) internal successors, (2214), 1619 states have internal predecessors, (2214), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-26 00:24:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2271 transitions. [2022-11-26 00:24:36,112 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2271 transitions. Word has length 81 [2022-11-26 00:24:36,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:36,112 INFO L495 AbstractCegarLoop]: Abstraction has 1656 states and 2271 transitions. [2022-11-26 00:24:36,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:24:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2271 transitions. [2022-11-26 00:24:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-26 00:24:36,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:36,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:36,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:36,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:36,328 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:36,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:36,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1094788593, now seen corresponding path program 1 times [2022-11-26 00:24:36,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:36,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921011293] [2022-11-26 00:24:36,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:36,329 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-26 00:24:36,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:36,330 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:36,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:36,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:24:36,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:36,767 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-26 00:24:36,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:36,767 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:36,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921011293] [2022-11-26 00:24:36,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921011293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:36,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:36,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:24:36,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872834839] [2022-11-26 00:24:36,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:36,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:24:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:36,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:24:36,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:24:36,770 INFO L87 Difference]: Start difference. First operand 1656 states and 2271 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 00:24:36,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:36,863 INFO L93 Difference]: Finished difference Result 1672 states and 2289 transitions. [2022-11-26 00:24:36,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:24:36,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 88 [2022-11-26 00:24:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:36,867 INFO L225 Difference]: With dead ends: 1672 [2022-11-26 00:24:36,867 INFO L226 Difference]: Without dead ends: 1666 [2022-11-26 00:24:36,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:24:36,868 INFO L413 NwaCegarLoop]: 962 mSDtfsCounter, 13 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:36,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2878 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:24:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2022-11-26 00:24:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2022-11-26 00:24:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1215 states have (on average 1.8304526748971193) internal successors, (2224), 1629 states have internal predecessors, (2224), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-26 00:24:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2283 transitions. [2022-11-26 00:24:36,894 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2283 transitions. Word has length 88 [2022-11-26 00:24:36,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:36,894 INFO L495 AbstractCegarLoop]: Abstraction has 1666 states and 2283 transitions. [2022-11-26 00:24:36,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 00:24:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2283 transitions. [2022-11-26 00:24:36,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-26 00:24:36,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:36,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:36,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:37,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:37,111 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:37,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:37,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1402763991, now seen corresponding path program 1 times [2022-11-26 00:24:37,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:37,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640655281] [2022-11-26 00:24:37,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:37,113 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-26 00:24:37,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:37,114 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:37,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:37,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:24:37,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:37,636 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-26 00:24:37,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:24:37,819 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-26 00:24:37,819 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:37,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640655281] [2022-11-26 00:24:37,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640655281] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:24:37,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [351987802] [2022-11-26 00:24:37,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:37,821 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:24:37,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:24:37,827 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:24:37,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-26 00:24:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:38,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:24:38,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:38,603 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-26 00:24:38,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:24:38,683 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-26 00:24:38,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [351987802] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:24:38,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316240171] [2022-11-26 00:24:38,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:38,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:24:38,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:24:38,689 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:24:38,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-26 00:24:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:39,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:24:39,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:39,085 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-26 00:24:39,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:24:39,172 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-26 00:24:39,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316240171] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:24:39,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 00:24:39,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2022-11-26 00:24:39,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133184808] [2022-11-26 00:24:39,173 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 00:24:39,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 00:24:39,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:39,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 00:24:39,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:24:39,175 INFO L87 Difference]: Start difference. First operand 1666 states and 2283 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-26 00:24:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:39,494 INFO L93 Difference]: Finished difference Result 1692 states and 2313 transitions. [2022-11-26 00:24:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 00:24:39,495 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 89 [2022-11-26 00:24:39,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:39,499 INFO L225 Difference]: With dead ends: 1692 [2022-11-26 00:24:39,499 INFO L226 Difference]: Without dead ends: 1680 [2022-11-26 00:24:39,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:24:39,500 INFO L413 NwaCegarLoop]: 965 mSDtfsCounter, 37 mSDsluCounter, 3839 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 4804 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:39,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 4804 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:24:39,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2022-11-26 00:24:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1674. [2022-11-26 00:24:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1223 states have (on average 1.8266557645134913) internal successors, (2234), 1637 states have internal predecessors, (2234), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-26 00:24:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2293 transitions. [2022-11-26 00:24:39,526 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2293 transitions. Word has length 89 [2022-11-26 00:24:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:39,527 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 2293 transitions. [2022-11-26 00:24:39,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-26 00:24:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2293 transitions. [2022-11-26 00:24:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-26 00:24:39,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:39,528 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:39,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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)] Forceful destruction successful, exit code 0 [2022-11-26 00:24:39,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-26 00:24:39,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2022-11-26 00:24:40,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-26 00:24:40,146 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:40,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:40,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1478348943, now seen corresponding path program 2 times [2022-11-26 00:24:40,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:40,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640037681] [2022-11-26 00:24:40,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:24:40,148 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-26 00:24:40,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:40,149 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:40,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:24:40,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:24:40,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:24:40,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-26 00:24:40,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:40,923 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-26 00:24:40,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:24:41,331 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-26 00:24:41,332 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:41,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640037681] [2022-11-26 00:24:41,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640037681] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:24:41,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1165366455] [2022-11-26 00:24:41,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:24:41,332 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:24:41,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:24:41,335 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:24:41,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-26 00:24:43,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:24:43,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:24:43,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-26 00:24:43,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:43,904 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-26 00:24:43,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:24:44,043 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-26 00:24:44,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1165366455] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:24:44,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819354656] [2022-11-26 00:24:44,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:24:44,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:24:44,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:24:44,047 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:24:44,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-26 00:25:17,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:25:17,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:25:17,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-26 00:25:17,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:17,596 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:25:17,596 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-26 00:25:17,640 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-26 00:25:18,364 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:25:18,364 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-26 00:25:18,473 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-26 00:25:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:25:18,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:25:18,721 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-26 00:25:18,722 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-26 00:25:18,734 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2306) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2022-11-26 00:25:18,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819354656] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:25:18,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-26 00:25:18,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 14] total 29 [2022-11-26 00:25:18,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437017928] [2022-11-26 00:25:18,738 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-26 00:25:18,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-26 00:25:18,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:25:18,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-26 00:25:18,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=756, Unknown=3, NotChecked=56, Total=930 [2022-11-26 00:25:18,741 INFO L87 Difference]: Start difference. First operand 1674 states and 2293 transitions. Second operand has 29 states, 28 states have (on average 6.071428571428571) internal successors, (170), 27 states have internal predecessors, (170), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-26 00:25:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:25:40,873 INFO L93 Difference]: Finished difference Result 2193 states and 2951 transitions. [2022-11-26 00:25:40,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-26 00:25:40,873 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 6.071428571428571) internal successors, (170), 27 states have internal predecessors, (170), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 92 [2022-11-26 00:25:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:25:40,877 INFO L225 Difference]: With dead ends: 2193 [2022-11-26 00:25:40,877 INFO L226 Difference]: Without dead ends: 2181 [2022-11-26 00:25:40,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=645, Invalid=3478, Unknown=41, NotChecked=126, Total=4290 [2022-11-26 00:25:40,879 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 970 mSDsluCounter, 8441 mSDsCounter, 0 mSdLazyCounter, 9377 mSolverCounterSat, 52 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 8948 SdHoareTripleChecker+Invalid, 9445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 9377 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:25:40,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 8948 Invalid, 9445 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 9377 Invalid, 16 Unknown, 0 Unchecked, 19.8s Time] [2022-11-26 00:25:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2022-11-26 00:25:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 1691. [2022-11-26 00:25:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1241 states have (on average 1.8178887993553585) internal successors, (2256), 1654 states have internal predecessors, (2256), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-26 00:25:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2315 transitions. [2022-11-26 00:25:40,923 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2315 transitions. Word has length 92 [2022-11-26 00:25:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:25:40,923 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 2315 transitions. [2022-11-26 00:25:40,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 6.071428571428571) internal successors, (170), 27 states have internal predecessors, (170), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-26 00:25:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2315 transitions. [2022-11-26 00:25:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-26 00:25:40,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:25:40,925 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:25:40,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-26 00:25:41,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-11-26 00:25:41,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:25:41,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:25:41,539 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:25:41,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:25:41,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2075896398, now seen corresponding path program 1 times [2022-11-26 00:25:41,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:25:41,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770412675] [2022-11-26 00:25:41,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:25:41,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:25:41,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:25:41,551 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:25:41,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:25:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:25:42,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-26 00:25:42,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:42,336 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-26 00:25:42,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:25:43,370 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-26 00:25:43,371 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:25:43,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770412675] [2022-11-26 00:25:43,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770412675] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:25:43,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [602111225] [2022-11-26 00:25:43,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:25:43,372 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:25:43,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:25:43,375 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:25:43,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-26 00:25:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:25:44,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-26 00:25:44,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:44,279 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-26 00:25:44,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:25:44,533 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-26 00:25:44,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [602111225] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:25:44,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835279257] [2022-11-26 00:25:44,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:25:44,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:25:44,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:25:44,535 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:25:44,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-26 00:25:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:25:44,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-26 00:25:45,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:45,151 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-26 00:25:45,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:25:47,176 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-26 00:25:47,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835279257] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:25:47,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 00:25:47,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15, 15] total 41 [2022-11-26 00:25:47,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025153949] [2022-11-26 00:25:47,177 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 00:25:47,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-26 00:25:47,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:25:47,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-26 00:25:47,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1187, Unknown=0, NotChecked=0, Total=1640 [2022-11-26 00:25:47,179 INFO L87 Difference]: Start difference. First operand 1691 states and 2315 transitions. Second operand has 41 states, 41 states have (on average 3.048780487804878) internal successors, (125), 41 states have internal predecessors, (125), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-26 00:25:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:25:52,404 INFO L93 Difference]: Finished difference Result 1799 states and 2453 transitions. [2022-11-26 00:25:52,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-26 00:25:52,405 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.048780487804878) internal successors, (125), 41 states have internal predecessors, (125), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 98 [2022-11-26 00:25:52,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:25:52,410 INFO L225 Difference]: With dead ends: 1799 [2022-11-26 00:25:52,410 INFO L226 Difference]: Without dead ends: 1781 [2022-11-26 00:25:52,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1810, Invalid=3890, Unknown=0, NotChecked=0, Total=5700 [2022-11-26 00:25:52,413 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 141 mSDsluCounter, 15552 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 16534 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:25:52,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 16534 Invalid, 779 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [41 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-26 00:25:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2022-11-26 00:25:52,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1727. [2022-11-26 00:25:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1277 states have (on average 1.802662490211433) internal successors, (2302), 1690 states have internal predecessors, (2302), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-26 00:25:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2361 transitions. [2022-11-26 00:25:52,457 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2361 transitions. Word has length 98 [2022-11-26 00:25:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:25:52,458 INFO L495 AbstractCegarLoop]: Abstraction has 1727 states and 2361 transitions. [2022-11-26 00:25:52,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.048780487804878) internal successors, (125), 41 states have internal predecessors, (125), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-26 00:25:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2361 transitions. [2022-11-26 00:25:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-26 00:25:52,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:25:52,460 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:25:52,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-11-26 00:25:52,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:25:52,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-26 00:25:53,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:25:53,068 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:25:53,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:25:53,069 INFO L85 PathProgramCache]: Analyzing trace with hash -493120974, now seen corresponding path program 2 times [2022-11-26 00:25:53,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:25:53,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434172299] [2022-11-26 00:25:53,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:25:53,069 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-26 00:25:53,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:25:53,070 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:25:53,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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 (32)] Waiting until timeout for monitored process [2022-11-26 00:25:53,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:25:53,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:25:53,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-26 00:25:53,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:54,812 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-26 00:25:54,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:26:00,830 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-26 00:26:00,831 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:26:00,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434172299] [2022-11-26 00:26:00,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434172299] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:26:00,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1165352800] [2022-11-26 00:26:00,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:26:00,831 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:26:00,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:26:00,835 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:26:00,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-26 00:26:03,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:26:03,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:26:03,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-26 00:26:03,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:03,965 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-26 00:26:03,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:26:05,962 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-26 00:26:05,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1165352800] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:26:05,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963051418] [2022-11-26 00:26:05,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:26:05,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:05,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:05,963 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:26:05,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-26 00:26:52,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:26:52,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:26:52,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-26 00:26:52,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:52,823 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-26 00:26:52,976 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:26:52,979 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-26 00:26:53,120 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-26 00:26:53,132 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-26 00:26:53,608 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-26 00:26:53,614 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-26 00:26:58,097 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:26:58,098 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-26 00:26:58,105 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-26 00:26:58,322 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-26 00:26:58,331 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-26 00:26:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-11-26 00:26:58,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:26:59,471 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3704 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3705) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3705 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3705) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-26 00:26:59,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963051418] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:26:59,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-26 00:26:59,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27, 27, 13] total 64 [2022-11-26 00:26:59,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646081985] [2022-11-26 00:26:59,479 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-26 00:26:59,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-26 00:26:59,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:26:59,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-26 00:26:59,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=762, Invalid=3501, Unknown=31, NotChecked=128, Total=4422 [2022-11-26 00:26:59,482 INFO L87 Difference]: Start difference. First operand 1727 states and 2361 transitions. Second operand has 64 states, 63 states have (on average 3.2698412698412698) internal successors, (206), 61 states have internal predecessors, (206), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-26 00:28:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:28:56,921 INFO L93 Difference]: Finished difference Result 2402 states and 3249 transitions. [2022-11-26 00:28:56,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-26 00:28:56,922 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.2698412698412698) internal successors, (206), 61 states have internal predecessors, (206), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 110 [2022-11-26 00:28:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:28:56,927 INFO L225 Difference]: With dead ends: 2402 [2022-11-26 00:28:56,927 INFO L226 Difference]: Without dead ends: 2384 [2022-11-26 00:28:56,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 459 SyntacticMatches, 27 SemanticMatches, 148 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6414 ImplicationChecksByTransitivity, 44.1s TimeCoverageRelationStatistics Valid=3726, Invalid=18244, Unknown=86, NotChecked=294, Total=22350 [2022-11-26 00:28:56,933 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 1265 mSDsluCounter, 16052 mSDsCounter, 0 mSdLazyCounter, 23392 mSolverCounterSat, 81 mSolverCounterUnsat, 756 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 16570 SdHoareTripleChecker+Invalid, 24229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 23392 IncrementalHoareTripleChecker+Invalid, 756 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:28:56,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 16570 Invalid, 24229 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [81 Valid, 23392 Invalid, 756 Unknown, 0 Unchecked, 83.5s Time] [2022-11-26 00:28:56,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2022-11-26 00:28:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1798. [2022-11-26 00:28:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1349 states have (on average 1.776130467012602) internal successors, (2396), 1761 states have internal predecessors, (2396), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-26 00:28:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2455 transitions. [2022-11-26 00:28:56,983 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2455 transitions. Word has length 110 [2022-11-26 00:28:56,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:28:56,984 INFO L495 AbstractCegarLoop]: Abstraction has 1798 states and 2455 transitions. [2022-11-26 00:28:56,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.2698412698412698) internal successors, (206), 61 states have internal predecessors, (206), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-26 00:28:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2455 transitions. [2022-11-26 00:28:56,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-26 00:28:56,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:28:56,986 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:28:57,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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 (32)] Forceful destruction successful, exit code 0 [2022-11-26 00:28:57,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2022-11-26 00:28:57,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-11-26 00:28:57,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:28:57,612 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:28:57,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:28:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1934250012, now seen corresponding path program 1 times [2022-11-26 00:28:57,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:28:57,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919069234] [2022-11-26 00:28:57,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:28:57,613 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-26 00:28:57,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:28:57,614 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:28:57,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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 (35)] Waiting until timeout for monitored process [2022-11-26 00:28:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:28:58,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-26 00:28:58,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:28:58,644 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-26 00:28:58,814 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:28:58,814 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-26 00:28:58,847 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-26 00:28:58,969 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-26 00:29:01,544 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:29:01,544 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-26 00:29:01,692 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:29:01,693 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-26 00:29:01,718 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-26 00:29:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:29:01,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:29:02,211 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4145) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-26 00:29:02,538 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4191))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4145)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:29:02,540 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:29:02,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919069234] [2022-11-26 00:29:02,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919069234] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:29:02,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1802111510] [2022-11-26 00:29:02,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:02,541 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:29:02,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:29:02,542 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:29:02,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-26 00:29:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:07,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-26 00:29:07,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:29:07,610 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-26 00:29:07,792 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:29:07,792 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-26 00:29:07,810 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-26 00:29:07,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-26 00:29:10,328 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:29:10,328 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-26 00:29:10,407 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:29:10,407 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-26 00:29:10,430 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-26 00:29:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:29:10,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:29:10,475 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4631) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:29:10,491 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:29:10,821 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4677))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4631)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-26 00:29:10,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1802111510] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:29:10,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912575715] [2022-11-26 00:29:10,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:10,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:29:10,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:29:10,825 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:29:10,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-26 00:29:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:11,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-26 00:29:11,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:29:11,729 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:29:11,729 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-26 00:29:11,772 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-26 00:29:14,425 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5114))) is different from true [2022-11-26 00:29:14,452 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:29:14,452 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-26 00:29:14,556 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:29:14,556 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-26 00:29:14,656 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-26 00:29:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-26 00:29:14,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:29:14,686 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-26 00:29:14,686 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-26 00:29:14,693 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem74#1.base|)) is different from false [2022-11-26 00:29:14,710 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-26 00:29:15,038 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5161)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-11-26 00:29:15,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912575715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:29:15,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:29:15,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 25 [2022-11-26 00:29:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208094274] [2022-11-26 00:29:15,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:29:15,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-26 00:29:15,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:29:15,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-26 00:29:15,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=603, Unknown=33, NotChecked=522, Total=1260 [2022-11-26 00:29:15,043 INFO L87 Difference]: Start difference. First operand 1798 states and 2455 transitions. Second operand has 26 states, 23 states have (on average 5.0) internal successors, (115), 22 states have internal predecessors, (115), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-26 00:29:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:29:37,738 INFO L93 Difference]: Finished difference Result 2274 states and 3057 transitions. [2022-11-26 00:29:37,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:29:37,739 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.0) internal successors, (115), 22 states have internal predecessors, (115), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 135 [2022-11-26 00:29:37,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:29:37,743 INFO L225 Difference]: With dead ends: 2274 [2022-11-26 00:29:37,743 INFO L226 Difference]: Without dead ends: 2274 [2022-11-26 00:29:37,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 260 SyntacticMatches, 133 SemanticMatches, 48 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=217, Invalid=1410, Unknown=49, NotChecked=774, Total=2450 [2022-11-26 00:29:37,745 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 1699 mSDsluCounter, 7219 mSDsCounter, 0 mSdLazyCounter, 8366 mSolverCounterSat, 50 mSolverCounterUnsat, 974 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 7708 SdHoareTripleChecker+Invalid, 10781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 8366 IncrementalHoareTripleChecker+Invalid, 974 IncrementalHoareTripleChecker+Unknown, 1391 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:29:37,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 7708 Invalid, 10781 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 8366 Invalid, 974 Unknown, 1391 Unchecked, 21.8s Time] [2022-11-26 00:29:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2022-11-26 00:29:37,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1795. [2022-11-26 00:29:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1349 states have (on average 1.7716827279466272) internal successors, (2390), 1758 states have internal predecessors, (2390), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-26 00:29:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2449 transitions. [2022-11-26 00:29:37,772 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2449 transitions. Word has length 135 [2022-11-26 00:29:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:29:37,772 INFO L495 AbstractCegarLoop]: Abstraction has 1795 states and 2449 transitions. [2022-11-26 00:29:37,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.0) internal successors, (115), 22 states have internal predecessors, (115), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-26 00:29:37,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2449 transitions. [2022-11-26 00:29:37,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-26 00:29:37,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:29:37,774 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:29:37,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-11-26 00:29:38,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-26 00:29:38,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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 (35)] Forceful destruction successful, exit code 0 [2022-11-26 00:29:38,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:29:38,391 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:29:38,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:29:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1934250013, now seen corresponding path program 1 times [2022-11-26 00:29:38,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:29:38,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175577711] [2022-11-26 00:29:38,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:38,392 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-26 00:29:38,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:29:38,393 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:29:38,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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 (38)] Waiting until timeout for monitored process [2022-11-26 00:29:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:39,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-26 00:29:39,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:29:39,591 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-26 00:29:39,958 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-26 00:29:40,001 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:29:40,001 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-26 00:29:40,041 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-26 00:29:40,049 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-26 00:29:40,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-26 00:29:40,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-26 00:29:42,587 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5646) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5645 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5645) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 00:29:42,642 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:29:42,642 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-26 00:29:42,651 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-26 00:29:42,821 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:29:42,821 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-26 00:29:42,833 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-26 00:29:42,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-26 00:29:42,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-26 00:29:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-26 00:29:42,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:29:43,135 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-26 00:29:43,175 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-26 00:29:44,263 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5740))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5739) .cse0 v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-26 00:29:44,273 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:29:44,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175577711] [2022-11-26 00:29:44,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175577711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:29:44,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1185507668] [2022-11-26 00:29:44,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:44,274 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:29:44,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:29:44,275 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:29:44,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-11-26 00:29:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:48,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-26 00:29:48,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:29:48,707 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-26 00:29:48,713 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-26 00:29:49,372 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:29:49,372 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-26 00:29:49,384 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-26 00:29:49,474 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-26 00:29:49,481 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-26 00:29:49,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-26 00:29:49,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-26 00:29:53,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:29:54,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:29:54,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2022-11-26 00:29:54,201 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-26 00:29:54,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2022-11-26 00:29:54,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-26 00:29:54,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-26 00:29:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:29:54,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:29:55,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 159 [2022-11-26 00:30:04,945 WARN L233 SmtUtils]: Spent 8.38s on a formula simplification. DAG size of input: 63 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:30:05,417 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6232))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_6185 (_ BitVec 32))) (let ((.cse0 (select (select (store .cse1 v_arrayElimCell_72 (store (select .cse1 v_arrayElimCell_72) (bvadd (_ bv16 32) .cse2) v_ArrVal_6185)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (not (bvule (bvadd .cse2 (_ bv20 32)) (select |c_#length| v_arrayElimCell_72))))))) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6232))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse6 (select |c_#length| v_arrayElimCell_72))) (or (bvule (bvadd (_ bv8 32) (select (select (store .cse4 v_arrayElimCell_72 (store (select .cse4 v_arrayElimCell_72) (bvadd (_ bv16 32) .cse5) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) .cse6) (not (bvule (bvadd .cse5 (_ bv20 32)) .cse6)))))))) is different from false [2022-11-26 00:30:05,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1185507668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:30:05,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268718742] [2022-11-26 00:30:05,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:30:05,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:30:05,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:30:05,443 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:30:05,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-26 00:30:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:30:06,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-26 00:30:06,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:30:06,533 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-26 00:30:06,563 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:30:06,563 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-26 00:30:06,693 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-26 00:30:06,702 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-26 00:30:07,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-26 00:30:07,045 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-26 00:30:09,959 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:30:09,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 46 treesize of output 45 [2022-11-26 00:30:09,969 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-26 00:30:10,318 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:30:10,318 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-26 00:30:10,332 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-26 00:30:10,358 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-26 00:30:10,365 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-26 00:30:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:30:10,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:30:10,438 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-26 00:30:10,474 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-26 00:30:11,513 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6809))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6810) .cse0 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6810) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-26 00:30:11,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268718742] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:30:11,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:30:11,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 36 [2022-11-26 00:30:11,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187506834] [2022-11-26 00:30:11,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:30:11,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-26 00:30:11,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:30:11,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-26 00:30:11,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1376, Unknown=79, NotChecked=664, Total=2256 [2022-11-26 00:30:11,526 INFO L87 Difference]: Start difference. First operand 1795 states and 2449 transitions. Second operand has 37 states, 33 states have (on average 7.212121212121212) internal successors, (238), 31 states have internal predecessors, (238), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-26 00:31:15,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:31:15,453 INFO L93 Difference]: Finished difference Result 2948 states and 3957 transitions. [2022-11-26 00:31:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-26 00:31:15,454 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 7.212121212121212) internal successors, (238), 31 states have internal predecessors, (238), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 135 [2022-11-26 00:31:15,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:31:15,459 INFO L225 Difference]: With dead ends: 2948 [2022-11-26 00:31:15,459 INFO L226 Difference]: Without dead ends: 2948 [2022-11-26 00:31:15,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 249 SyntacticMatches, 131 SemanticMatches, 61 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=280, Invalid=2612, Unknown=110, NotChecked=904, Total=3906 [2022-11-26 00:31:15,461 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 2576 mSDsluCounter, 10369 mSDsCounter, 0 mSdLazyCounter, 23315 mSolverCounterSat, 60 mSolverCounterUnsat, 2269 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2581 SdHoareTripleChecker+Valid, 11022 SdHoareTripleChecker+Invalid, 27562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 23315 IncrementalHoareTripleChecker+Invalid, 2269 IncrementalHoareTripleChecker+Unknown, 1918 IncrementalHoareTripleChecker+Unchecked, 61.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:31:15,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2581 Valid, 11022 Invalid, 27562 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [60 Valid, 23315 Invalid, 2269 Unknown, 1918 Unchecked, 61.7s Time] [2022-11-26 00:31:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2022-11-26 00:31:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 2096. [2022-11-26 00:31:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 1644 states have (on average 1.7919708029197081) internal successors, (2946), 2054 states have internal predecessors, (2946), 33 states have call successors, (33), 18 states have call predecessors, (33), 18 states have return successors, (36), 26 states have call predecessors, (36), 33 states have call successors, (36) [2022-11-26 00:31:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3015 transitions. [2022-11-26 00:31:15,493 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 3015 transitions. Word has length 135 [2022-11-26 00:31:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:31:15,494 INFO L495 AbstractCegarLoop]: Abstraction has 2096 states and 3015 transitions. [2022-11-26 00:31:15,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 7.212121212121212) internal successors, (238), 31 states have internal predecessors, (238), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-26 00:31:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3015 transitions. [2022-11-26 00:31:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-26 00:31:15,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:31:15,496 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:31:15,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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 (38)] Forceful destruction successful, exit code 0 [2022-11-26 00:31:15,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2022-11-26 00:31:15,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-26 00:31:16,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:31:16,118 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:31:16,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:31:16,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1961199032, now seen corresponding path program 1 times [2022-11-26 00:31:16,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:31:16,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761545081] [2022-11-26 00:31:16,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:31:16,120 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-26 00:31:16,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:31:16,120 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:31:16,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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)] Waiting until timeout for monitored process [2022-11-26 00:31:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:31:17,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-26 00:31:17,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:31:17,353 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-26 00:31:17,711 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:31:17,711 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-26 00:31:17,749 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-26 00:31:17,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-26 00:31:20,586 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:31:20,586 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-26 00:31:20,736 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:31:20,737 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-26 00:31:20,860 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:31:20,860 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-26 00:31:20,885 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-26 00:31:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:31:20,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:31:21,040 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7266) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2022-11-26 00:31:21,052 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-26 00:31:21,071 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7265))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7266)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:31:21,086 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7265))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7266)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:31:21,460 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7312))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7265)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7266)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:31:21,464 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:31:21,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761545081] [2022-11-26 00:31:21,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761545081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:31:21,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [468301262] [2022-11-26 00:31:21,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:31:21,465 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:31:21,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:31:21,467 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:31:21,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-11-26 00:31:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:31:31,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-26 00:31:31,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:31:31,660 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-26 00:31:31,845 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:31:31,845 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-26 00:31:31,863 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-26 00:31:31,934 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-26 00:31:34,599 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:31:34,599 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-26 00:31:34,687 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:31:34,688 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-26 00:31:34,746 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:31:34,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-26 00:31:34,771 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-26 00:31:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:31:34,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:31:34,802 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7768) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-26 00:31:34,814 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7768) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-26 00:31:34,834 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7767))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7768)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:31:36,107 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7814))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7767)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7768)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:31:36,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [468301262] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:31:36,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594414103] [2022-11-26 00:31:36,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:31:36,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:31:36,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:31:36,115 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:31:36,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-26 00:31:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:31:37,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-26 00:31:37,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:31:37,291 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:31:37,292 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-26 00:31:37,339 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-26 00:31:40,856 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:31:40,857 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-26 00:31:41,081 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:31:41,082 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-26 00:31:41,211 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:31:41,211 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-26 00:31:41,230 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-26 00:31:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:31:41,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:31:41,256 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8268) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:31:41,435 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8267))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8268)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:31:41,450 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8267))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8268)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-26 00:31:41,849 INFO L321 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2022-11-26 00:31:41,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2022-11-26 00:31:41,864 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8314 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8314))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8267)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8268)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2022-11-26 00:31:41,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594414103] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:31:41,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:31:41,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 28 [2022-11-26 00:31:41,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259185322] [2022-11-26 00:31:41,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:31:41,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-26 00:31:41,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:31:41,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-26 00:31:41,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=845, Unknown=53, NotChecked=936, Total=1980 [2022-11-26 00:31:41,870 INFO L87 Difference]: Start difference. First operand 2096 states and 3015 transitions. Second operand has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-26 00:32:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:07,443 INFO L93 Difference]: Finished difference Result 2574 states and 3621 transitions. [2022-11-26 00:32:07,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 00:32:07,443 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 138 [2022-11-26 00:32:07,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:07,446 INFO L225 Difference]: With dead ends: 2574 [2022-11-26 00:32:07,446 INFO L226 Difference]: Without dead ends: 2574 [2022-11-26 00:32:07,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 269 SyntacticMatches, 131 SemanticMatches, 60 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1854 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=307, Invalid=2023, Unknown=74, NotChecked=1378, Total=3782 [2022-11-26 00:32:07,448 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 1697 mSDsluCounter, 7608 mSDsCounter, 0 mSdLazyCounter, 8797 mSolverCounterSat, 48 mSolverCounterUnsat, 1003 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1700 SdHoareTripleChecker+Valid, 8096 SdHoareTripleChecker+Invalid, 9848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 8797 IncrementalHoareTripleChecker+Invalid, 1003 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:07,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1700 Valid, 8096 Invalid, 9848 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 8797 Invalid, 1003 Unknown, 0 Unchecked, 24.3s Time] [2022-11-26 00:32:07,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2022-11-26 00:32:07,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2095. [2022-11-26 00:32:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2095 states, 1644 states have (on average 1.7907542579075426) internal successors, (2944), 2053 states have internal predecessors, (2944), 33 states have call successors, (33), 18 states have call predecessors, (33), 18 states have return successors, (36), 26 states have call predecessors, (36), 33 states have call successors, (36) [2022-11-26 00:32:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 3013 transitions. [2022-11-26 00:32:07,477 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 3013 transitions. Word has length 138 [2022-11-26 00:32:07,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:07,478 INFO L495 AbstractCegarLoop]: Abstraction has 2095 states and 3013 transitions. [2022-11-26 00:32:07,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-26 00:32:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 3013 transitions. [2022-11-26 00:32:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-26 00:32:07,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:07,480 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:32:07,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-11-26 00:32:07,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2022-11-26 00:32:07,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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)] Forceful destruction successful, exit code 0 [2022-11-26 00:32:08,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:32:08,098 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:32:08,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:08,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1961199033, now seen corresponding path program 1 times [2022-11-26 00:32:08,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:32:08,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501893055] [2022-11-26 00:32:08,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:08,099 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-26 00:32:08,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:32:08,100 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:32:08,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:32:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:09,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-26 00:32:09,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:32:09,395 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-26 00:32:09,774 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-26 00:32:09,825 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:32:09,826 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-26 00:32:09,869 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-26 00:32:09,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:32:10,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-26 00:32:10,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-26 00:32:12,830 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:12,831 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-26 00:32:12,845 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-26 00:32:13,009 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:13,010 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-26 00:32:13,022 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-26 00:32:13,166 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:13,166 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-26 00:32:13,173 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-26 00:32:13,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-26 00:32:13,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-26 00:32:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:32:13,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:32:13,589 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-26 00:32:13,634 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-26 00:32:13,705 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8816))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8815) .cse0 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8815) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-26 00:32:13,771 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8816))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8815) .cse1 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8815) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-26 00:32:14,866 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8909 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8909))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8816))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8910) .cse0 v_ArrVal_8815) .cse1 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8909 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8909))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8910) .cse6 v_ArrVal_8815) (select (select (store .cse7 .cse6 v_ArrVal_8816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8818))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-26 00:32:14,879 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:32:14,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501893055] [2022-11-26 00:32:14,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501893055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:32:14,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [620613822] [2022-11-26 00:32:14,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:14,880 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:32:14,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:32:14,881 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:32:14,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-11-26 00:32:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:21,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 125 conjunts are in the unsatisfiable core [2022-11-26 00:32:21,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:32:21,061 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-26 00:32:21,327 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-26 00:32:21,357 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:32:21,357 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-26 00:32:21,429 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-26 00:32:21,438 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-26 00:32:21,661 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-26 00:32:21,666 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-26 00:32:24,215 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_9409) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_107 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_107) (_ bv44 32))) (exists ((v_ArrVal_9410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_9410)))) is different from true [2022-11-26 00:32:24,276 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:24,277 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-26 00:32:24,283 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-26 00:32:24,507 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:24,507 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-26 00:32:24,517 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-26 00:32:24,671 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:24,671 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-26 00:32:24,681 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-26 00:32:24,710 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-26 00:32:24,713 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-26 00:32:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-26 00:32:24,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:32:24,787 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-26 00:32:24,822 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-26 00:32:24,943 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9411))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9412) .cse0 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9412) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-26 00:32:25,182 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9412) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9411))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9412) .cse3 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-26 00:32:26,962 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9505))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9506) .cse1 v_ArrVal_9412) (select (select (store .cse2 .cse1 v_ArrVal_9411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9413))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9505))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9411))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9506) .cse4 v_ArrVal_9412) .cse5 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-26 00:32:26,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [620613822] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:32:26,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49202020] [2022-11-26 00:32:26,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:26,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:32:26,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:32:26,980 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:32:26,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-26 00:32:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:27,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-26 00:32:27,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:32:28,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 5 [2022-11-26 00:32:28,275 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:32:28,276 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-26 00:32:28,292 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-26 00:32:28,305 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-26 00:32:28,402 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-26 00:32:28,409 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-26 00:32:32,200 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10005))) (exists ((v_arrayElimCell_107 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_107) (_ bv44 32))) (exists ((v_ArrVal_10004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10004)))) is different from true [2022-11-26 00:32:32,289 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:32,289 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-26 00:32:32,297 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-26 00:32:32,493 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:32,493 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-26 00:32:32,502 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-26 00:32:32,595 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:32,596 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-26 00:32:32,609 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-26 00:32:32,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-26 00:32:32,655 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-26 00:32:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-26 00:32:32,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:32:32,750 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-26 00:32:32,794 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-26 00:32:33,079 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10006))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10007) .cse0 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10007) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-26 00:32:33,190 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10007) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10006))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10007) .cse3 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-26 00:32:47,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49202020] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:32:47,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:32:47,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 25 [2022-11-26 00:32:47,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029821737] [2022-11-26 00:32:47,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:32:47,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-26 00:32:47,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:32:47,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-26 00:32:47,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=606, Unknown=47, NotChecked=1040, Total=1806 [2022-11-26 00:32:47,157 INFO L87 Difference]: Start difference. First operand 2095 states and 3013 transitions. Second operand has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-26 00:34:55,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:55,192 INFO L93 Difference]: Finished difference Result 2922 states and 3931 transitions. [2022-11-26 00:34:55,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:34:55,193 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 138 [2022-11-26 00:34:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:55,197 INFO L225 Difference]: With dead ends: 2922 [2022-11-26 00:34:55,197 INFO L226 Difference]: Without dead ends: 2922 [2022-11-26 00:34:55,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 268 SyntacticMatches, 134 SemanticMatches, 53 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=205, Invalid=1281, Unknown=60, NotChecked=1424, Total=2970 [2022-11-26 00:34:55,203 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 1981 mSDsluCounter, 7256 mSDsCounter, 0 mSdLazyCounter, 13499 mSolverCounterSat, 31 mSolverCounterUnsat, 625 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 117.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1986 SdHoareTripleChecker+Valid, 8045 SdHoareTripleChecker+Invalid, 17111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 13499 IncrementalHoareTripleChecker+Invalid, 625 IncrementalHoareTripleChecker+Unknown, 2956 IncrementalHoareTripleChecker+Unchecked, 122.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:55,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1986 Valid, 8045 Invalid, 17111 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [31 Valid, 13499 Invalid, 625 Unknown, 2956 Unchecked, 122.1s Time] [2022-11-26 00:34:55,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-11-26 00:34:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2094. [2022-11-26 00:34:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2094 states, 1644 states have (on average 1.789537712895377) internal successors, (2942), 2052 states have internal predecessors, (2942), 33 states have call successors, (33), 18 states have call predecessors, (33), 18 states have return successors, (36), 26 states have call predecessors, (36), 33 states have call successors, (36) [2022-11-26 00:34:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3011 transitions. [2022-11-26 00:34:55,233 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3011 transitions. Word has length 138 [2022-11-26 00:34:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:55,234 INFO L495 AbstractCegarLoop]: Abstraction has 2094 states and 3011 transitions. [2022-11-26 00:34:55,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-26 00:34:55,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3011 transitions. [2022-11-26 00:34:55,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-26 00:34:55,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:55,236 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:55,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2022-11-26 00:34:55,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-11-26 00:34:55,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:34:55,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:34:55,851 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:34:55,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1640576451, now seen corresponding path program 1 times [2022-11-26 00:34:55,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:34:55,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3005165] [2022-11-26 00:34:55,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:55,853 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-26 00:34:55,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:34:55,854 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:34:55,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/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-26 00:34:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:57,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-26 00:34:57,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:57,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-26 00:34:58,693 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:34:58,694 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-26 00:34:58,900 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-26 00:34:59,474 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-26 00:35:09,705 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_32| (_ BitVec 32)) (v_arrayElimCell_143 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_143) (_ bv1 1))) (not (= v_arrayElimCell_143 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_32|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_32|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_10570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10570) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 00:35:10,046 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:10,047 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-26 00:35:10,600 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:10,601 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-26 00:35:11,122 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:11,122 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-26 00:35:11,640 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:11,640 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-26 00:35:11,738 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-26 00:35:12,006 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-26 00:35:12,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:35:12,453 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10573) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-26 00:35:12,507 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-11-26 00:35:12,581 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10572))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:35:12,641 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10572))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:35:12,727 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10571))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10572)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:35:12,795 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10571))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10572)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:35:14,011 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10619))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10571)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10572)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:35:14,023 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:35:14,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3005165] [2022-11-26 00:35:14,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3005165] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:35:14,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2132404281] [2022-11-26 00:35:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:14,024 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:35:14,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:35:14,025 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:35:14,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-11-26 00:35:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:22,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-26 00:35:22,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:35:22,346 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-26 00:35:23,466 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:35:23,466 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-26 00:35:23,553 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-26 00:35:23,818 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-26 00:35:34,318 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:34,319 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-26 00:35:34,694 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:34,694 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-26 00:35:34,987 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:34,987 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-26 00:35:35,289 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:35,289 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-26 00:35:35,389 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-26 00:35:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:35:35,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:35:35,531 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_11091) |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-26 00:35:35,624 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_11091) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-26 00:35:35,703 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_11090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-26 00:35:37,646 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_11089))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11090)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:35:37,707 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11089))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11090)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-26 00:35:38,948 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_11137))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11089)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11090)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:35:38,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2132404281] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:35:38,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826960364] [2022-11-26 00:35:38,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:38,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:35:38,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:35:38,961 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:35:38,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96b0584d-381d-4653-b168-525aa98956d2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-26 00:35:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:40,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-26 00:35:40,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:35:41,232 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:35:41,232 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-26 00:35:41,480 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-26 00:35:56,008 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_11604 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_11604))) is different from true [2022-11-26 00:35:56,152 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:56,152 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-26 00:35:56,621 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:56,622 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-26 00:35:57,106 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:57,106 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-26 00:35:57,594 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:57,594 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-26 00:35:58,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-26 00:35:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-26 00:35:58,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:35:58,176 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-26 00:35:58,176 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-26 00:35:58,889 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-26 00:35:58,950 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_11606)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-11-26 00:35:58,994 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-26 00:35:59,060 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11605 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_11605))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-26 00:35:59,109 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11605 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11605))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2022-11-26 00:36:00,390 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11605 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_11653))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11605)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-26 00:36:00,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826960364] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:36:00,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:36:00,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2022-11-26 00:36:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053738128] [2022-11-26 00:36:00,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:36:00,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-26 00:36:00,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:36:00,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-26 00:36:00,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=848, Unknown=72, NotChecked=1680, Total=2756 [2022-11-26 00:36:00,404 INFO L87 Difference]: Start difference. First operand 2094 states and 3011 transitions. Second operand has 31 states, 28 states have (on average 4.678571428571429) internal successors, (131), 27 states have internal predecessors, (131), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6)