./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 13:29:39,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 13:29:39,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 13:29:39,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 13:29:39,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 13:29:39,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 13:29:39,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 13:29:39,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 13:29:39,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 13:29:39,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 13:29:39,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 13:29:39,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 13:29:39,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 13:29:39,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 13:29:39,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 13:29:39,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 13:29:39,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 13:29:39,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 13:29:39,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 13:29:39,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 13:29:39,850 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 13:29:39,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 13:29:39,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 13:29:39,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 13:29:39,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 13:29:39,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 13:29:39,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 13:29:39,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 13:29:39,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 13:29:39,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 13:29:39,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 13:29:39,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 13:29:39,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 13:29:39,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 13:29:39,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 13:29:39,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 13:29:39,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 13:29:39,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 13:29:39,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 13:29:39,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 13:29:39,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 13:29:39,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 13:29:39,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 13:29:39,889 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 13:29:39,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 13:29:39,890 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 13:29:39,890 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 13:29:39,891 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 13:29:39,891 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 13:29:39,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 13:29:39,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 13:29:39,892 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 13:29:39,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 13:29:39,892 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 13:29:39,892 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 13:29:39,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 13:29:39,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 13:29:39,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 13:29:39,893 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 13:29:39,893 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 13:29:39,893 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 13:29:39,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 13:29:39,894 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 13:29:39,894 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 13:29:39,894 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 13:29:39,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 13:29:39,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 13:29:39,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 13:29:39,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 13:29:39,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 13:29:39,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 13:29:39,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 13:29:39,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 13:29:39,895 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd [2022-07-20 13:29:40,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 13:29:40,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 13:29:40,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 13:29:40,143 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 13:29:40,144 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 13:29:40,145 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2022-07-20 13:29:40,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f79c9988a/0f2fbdec83ac4151816f633f01e6c322/FLAG0a92bee27 [2022-07-20 13:29:40,654 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 13:29:40,654 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2022-07-20 13:29:40,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f79c9988a/0f2fbdec83ac4151816f633f01e6c322/FLAG0a92bee27 [2022-07-20 13:29:40,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f79c9988a/0f2fbdec83ac4151816f633f01e6c322 [2022-07-20 13:29:40,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 13:29:40,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 13:29:40,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 13:29:40,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 13:29:40,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 13:29:40,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:29:40" (1/1) ... [2022-07-20 13:29:40,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b7ee77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:40, skipping insertion in model container [2022-07-20 13:29:40,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:29:40" (1/1) ... [2022-07-20 13:29:40,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 13:29:40,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 13:29:41,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i[33021,33034] [2022-07-20 13:29:41,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i[45234,45247] [2022-07-20 13:29:41,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 13:29:41,120 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-07-20 13:29:41,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6c8985f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:41, skipping insertion in model container [2022-07-20 13:29:41,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 13:29:41,121 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-20 13:29:41,122 INFO L158 Benchmark]: Toolchain (without parser) took 414.58ms. Allocated memory is still 98.6MB. Free memory was 76.6MB in the beginning and 56.9MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-20 13:29:41,123 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 98.6MB. Free memory was 77.6MB in the beginning and 77.5MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 13:29:41,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.33ms. Allocated memory is still 98.6MB. Free memory was 76.4MB in the beginning and 56.9MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-20 13:29:41,124 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.13ms. Allocated memory is still 98.6MB. Free memory was 77.6MB in the beginning and 77.5MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.33ms. Allocated memory is still 98.6MB. Free memory was 76.4MB in the beginning and 56.9MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: 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/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 13:29:42,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 13:29:42,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 13:29:42,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 13:29:42,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 13:29:42,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 13:29:42,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 13:29:42,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 13:29:42,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 13:29:42,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 13:29:42,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 13:29:42,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 13:29:42,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 13:29:42,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 13:29:42,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 13:29:42,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 13:29:42,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 13:29:42,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 13:29:42,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 13:29:42,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 13:29:42,526 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 13:29:42,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 13:29:42,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 13:29:42,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 13:29:42,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 13:29:42,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 13:29:42,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 13:29:42,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 13:29:42,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 13:29:42,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 13:29:42,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 13:29:42,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 13:29:42,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 13:29:42,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 13:29:42,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 13:29:42,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 13:29:42,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 13:29:42,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 13:29:42,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 13:29:42,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 13:29:42,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 13:29:42,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 13:29:42,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 13:29:42,564 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 13:29:42,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 13:29:42,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 13:29:42,565 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 13:29:42,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 13:29:42,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 13:29:42,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 13:29:42,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 13:29:42,566 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 13:29:42,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 13:29:42,567 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 13:29:42,567 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 13:29:42,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 13:29:42,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 13:29:42,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 13:29:42,567 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 13:29:42,567 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 13:29:42,568 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 13:29:42,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 13:29:42,568 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 13:29:42,568 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 13:29:42,568 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 13:29:42,568 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 13:29:42,568 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 13:29:42,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 13:29:42,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 13:29:42,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 13:29:42,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 13:29:42,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 13:29:42,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 13:29:42,569 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 13:29:42,570 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 13:29:42,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 13:29:42,570 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd [2022-07-20 13:29:42,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 13:29:42,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 13:29:42,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 13:29:42,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 13:29:42,841 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 13:29:42,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2022-07-20 13:29:42,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/531067442/e130e0de1d3e42239535962c3f5301e1/FLAG69cc0a26f [2022-07-20 13:29:43,292 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 13:29:43,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2022-07-20 13:29:43,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/531067442/e130e0de1d3e42239535962c3f5301e1/FLAG69cc0a26f [2022-07-20 13:29:43,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/531067442/e130e0de1d3e42239535962c3f5301e1 [2022-07-20 13:29:43,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 13:29:43,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 13:29:43,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 13:29:43,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 13:29:43,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 13:29:43,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:29:43" (1/1) ... [2022-07-20 13:29:43,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f6ecb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:43, skipping insertion in model container [2022-07-20 13:29:43,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:29:43" (1/1) ... [2022-07-20 13:29:43,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 13:29:43,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 13:29:43,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i[33021,33034] [2022-07-20 13:29:43,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i[45234,45247] [2022-07-20 13:29:43,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 13:29:43,807 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 13:29:43,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 13:29:43,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i[33021,33034] [2022-07-20 13:29:43,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i[45234,45247] [2022-07-20 13:29:43,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 13:29:43,893 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 13:29:43,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i[33021,33034] [2022-07-20 13:29:43,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i[45234,45247] [2022-07-20 13:29:43,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 13:29:43,957 INFO L208 MainTranslator]: Completed translation [2022-07-20 13:29:43,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:43 WrapperNode [2022-07-20 13:29:43,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 13:29:43,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 13:29:43,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 13:29:43,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 13:29:43,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:43" (1/1) ... [2022-07-20 13:29:44,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:43" (1/1) ... [2022-07-20 13:29:44,086 INFO L137 Inliner]: procedures = 180, calls = 348, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1175 [2022-07-20 13:29:44,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 13:29:44,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 13:29:44,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 13:29:44,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 13:29:44,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:43" (1/1) ... [2022-07-20 13:29:44,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:43" (1/1) ... [2022-07-20 13:29:44,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:43" (1/1) ... [2022-07-20 13:29:44,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:43" (1/1) ... [2022-07-20 13:29:44,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:43" (1/1) ... [2022-07-20 13:29:44,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:43" (1/1) ... [2022-07-20 13:29:44,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:43" (1/1) ... [2022-07-20 13:29:44,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 13:29:44,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 13:29:44,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 13:29:44,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 13:29:44,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:43" (1/1) ... [2022-07-20 13:29:44,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 13:29:44,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 13:29:44,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 13:29:44,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 13:29:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-20 13:29:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 13:29:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-20 13:29:44,247 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-20 13:29:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-20 13:29:44,248 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-20 13:29:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2022-07-20 13:29:44,248 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2022-07-20 13:29:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 13:29:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 13:29:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 13:29:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 13:29:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-20 13:29:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 13:29:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 13:29:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 13:29:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 13:29:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 13:29:44,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 13:29:44,475 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 13:29:44,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 13:29:44,478 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 13:29:47,350 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 13:29:47,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 13:29:47,373 INFO L299 CfgBuilder]: Removed 71 assume(true) statements. [2022-07-20 13:29:47,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:29:47 BoogieIcfgContainer [2022-07-20 13:29:47,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 13:29:47,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 13:29:47,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 13:29:47,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 13:29:47,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 01:29:43" (1/3) ... [2022-07-20 13:29:47,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4625e04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:29:47, skipping insertion in model container [2022-07-20 13:29:47,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:29:43" (2/3) ... [2022-07-20 13:29:47,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4625e04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:29:47, skipping insertion in model container [2022-07-20 13:29:47,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:29:47" (3/3) ... [2022-07-20 13:29:47,382 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test8-2.i [2022-07-20 13:29:47,391 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 13:29:47,392 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 641 error locations. [2022-07-20 13:29:47,456 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 13:29:47,462 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@27b454a5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@180f5f7d [2022-07-20 13:29:47,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 641 error locations. [2022-07-20 13:29:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 1296 states, 634 states have (on average 2.2539432176656153) internal successors, (1429), 1287 states have internal predecessors, (1429), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-20 13:29:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 13:29:47,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:29:47,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 13:29:47,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:29:47,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:29:47,478 INFO L85 PathProgramCache]: Analyzing trace with hash 132136, now seen corresponding path program 1 times [2022-07-20 13:29:47,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:29:47,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588174187] [2022-07-20 13:29:47,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:29:47,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:29:47,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:29:47,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:29:47,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 13:29:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:29:47,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:29:47,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:29:47,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:29:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:29:47,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:29:47,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:29:47,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588174187] [2022-07-20 13:29:47,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588174187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:29:47,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:29:47,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 13:29:47,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921623668] [2022-07-20 13:29:47,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:29:47,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:29:47,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:29:47,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:29:47,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:29:47,713 INFO L87 Difference]: Start difference. First operand has 1296 states, 634 states have (on average 2.2539432176656153) internal successors, (1429), 1287 states have internal predecessors, (1429), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) 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-07-20 13:29:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:29:49,174 INFO L93 Difference]: Finished difference Result 1476 states and 1582 transitions. [2022-07-20 13:29:49,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:29:49,176 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-07-20 13:29:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:29:49,188 INFO L225 Difference]: With dead ends: 1476 [2022-07-20 13:29:49,188 INFO L226 Difference]: Without dead ends: 1474 [2022-07-20 13:29:49,189 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-07-20 13:29:49,191 INFO L413 NwaCegarLoop]: 817 mSDtfsCounter, 1162 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 13:29:49,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 1048 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-20 13:29:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2022-07-20 13:29:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1285. [2022-07-20 13:29:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 637 states have (on average 2.111459968602826) internal successors, (1345), 1275 states have internal predecessors, (1345), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-20 13:29:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1387 transitions. [2022-07-20 13:29:49,295 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1387 transitions. Word has length 3 [2022-07-20 13:29:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:29:49,295 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 1387 transitions. [2022-07-20 13:29:49,295 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-07-20 13:29:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1387 transitions. [2022-07-20 13:29:49,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 13:29:49,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:29:49,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 13:29:49,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 13:29:49,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:29:49,500 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:29:49,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:29:49,501 INFO L85 PathProgramCache]: Analyzing trace with hash 132137, now seen corresponding path program 1 times [2022-07-20 13:29:49,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:29:49,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779317273] [2022-07-20 13:29:49,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:29:49,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:29:49,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:29:49,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:29:49,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 13:29:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:29:49,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 13:29:49,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:29:49,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:29:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:29:49,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:29:49,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:29:49,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779317273] [2022-07-20 13:29:49,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779317273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:29:49,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:29:49,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 13:29:49,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130519895] [2022-07-20 13:29:49,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:29:49,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:29:49,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:29:49,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:29:49,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:29:49,654 INFO L87 Difference]: Start difference. First operand 1285 states and 1387 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-07-20 13:29:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:29:51,799 INFO L93 Difference]: Finished difference Result 1877 states and 2020 transitions. [2022-07-20 13:29:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:29:51,800 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-07-20 13:29:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:29:51,805 INFO L225 Difference]: With dead ends: 1877 [2022-07-20 13:29:51,805 INFO L226 Difference]: Without dead ends: 1877 [2022-07-20 13:29:51,805 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-07-20 13:29:51,806 INFO L413 NwaCegarLoop]: 1090 mSDtfsCounter, 631 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-20 13:29:51,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1840 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-20 13:29:51,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2022-07-20 13:29:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1489. [2022-07-20 13:29:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 841 states have (on average 2.097502972651605) internal successors, (1764), 1478 states have internal predecessors, (1764), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-20 13:29:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1808 transitions. [2022-07-20 13:29:51,840 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1808 transitions. Word has length 3 [2022-07-20 13:29:51,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:29:51,841 INFO L495 AbstractCegarLoop]: Abstraction has 1489 states and 1808 transitions. [2022-07-20 13:29:51,841 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-07-20 13:29:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1808 transitions. [2022-07-20 13:29:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 13:29:51,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:29:51,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:29:51,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 13:29:52,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:29:52,048 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:29:52,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:29:52,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1773817970, now seen corresponding path program 1 times [2022-07-20 13:29:52,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:29:52,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679490513] [2022-07-20 13:29:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:29:52,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:29:52,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:29:52,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:29:52,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 13:29:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:29:52,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 13:29:52,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:29:52,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:29:52,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:29:52,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 13:29:52,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 13:29:52,207 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 13:29:52,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 13:29:52,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:29:52,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:29:52,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:29:52,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679490513] [2022-07-20 13:29:52,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679490513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:29:52,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:29:52,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:29:52,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435688991] [2022-07-20 13:29:52,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:29:52,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:29:52,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:29:52,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:29:52,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:29:52,224 INFO L87 Difference]: Start difference. First operand 1489 states and 1808 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:29:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:29:54,360 INFO L93 Difference]: Finished difference Result 1671 states and 1997 transitions. [2022-07-20 13:29:54,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:29:54,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 13:29:54,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:29:54,365 INFO L225 Difference]: With dead ends: 1671 [2022-07-20 13:29:54,365 INFO L226 Difference]: Without dead ends: 1671 [2022-07-20 13:29:54,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:29:54,366 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 2605 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2611 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-20 13:29:54,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2611 Valid, 645 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-20 13:29:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-07-20 13:29:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1274. [2022-07-20 13:29:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 637 states have (on average 2.0926216640502355) internal successors, (1333), 1264 states have internal predecessors, (1333), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-20 13:29:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1375 transitions. [2022-07-20 13:29:54,393 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1375 transitions. Word has length 7 [2022-07-20 13:29:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:29:54,394 INFO L495 AbstractCegarLoop]: Abstraction has 1274 states and 1375 transitions. [2022-07-20 13:29:54,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:29:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1375 transitions. [2022-07-20 13:29:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 13:29:54,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:29:54,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:29:54,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 13:29:54,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:29:54,602 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:29:54,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:29:54,603 INFO L85 PathProgramCache]: Analyzing trace with hash -846217710, now seen corresponding path program 1 times [2022-07-20 13:29:54,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:29:54,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909917721] [2022-07-20 13:29:54,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:29:54,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:29:54,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:29:54,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:29:54,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 13:29:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:29:54,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:29:54,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:29:54,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:29:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:29:54,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:29:54,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:29:54,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909917721] [2022-07-20 13:29:54,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909917721] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:29:54,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:29:54,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 13:29:54,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301077072] [2022-07-20 13:29:54,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:29:54,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:29:54,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:29:54,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:29:54,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:29:54,722 INFO L87 Difference]: Start difference. First operand 1274 states and 1375 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:29:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:29:56,028 INFO L93 Difference]: Finished difference Result 1601 states and 1729 transitions. [2022-07-20 13:29:56,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:29:56,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 13:29:56,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:29:56,044 INFO L225 Difference]: With dead ends: 1601 [2022-07-20 13:29:56,044 INFO L226 Difference]: Without dead ends: 1601 [2022-07-20 13:29:56,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:29:56,045 INFO L413 NwaCegarLoop]: 1204 mSDtfsCounter, 988 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 13:29:56,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1610 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-20 13:29:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-07-20 13:29:56,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1227. [2022-07-20 13:29:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 637 states have (on average 2.0172684458398744) internal successors, (1285), 1217 states have internal predecessors, (1285), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-20 13:29:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1327 transitions. [2022-07-20 13:29:56,063 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1327 transitions. Word has length 8 [2022-07-20 13:29:56,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:29:56,064 INFO L495 AbstractCegarLoop]: Abstraction has 1227 states and 1327 transitions. [2022-07-20 13:29:56,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:29:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1327 transitions. [2022-07-20 13:29:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 13:29:56,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:29:56,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:29:56,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-20 13:29:56,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:29:56,271 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:29:56,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:29:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash -846217709, now seen corresponding path program 1 times [2022-07-20 13:29:56,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:29:56,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578988627] [2022-07-20 13:29:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:29:56,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:29:56,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:29:56,273 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:29:56,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 13:29:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:29:56,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 13:29:56,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:29:56,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:29:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:29:56,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:29:56,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:29:56,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578988627] [2022-07-20 13:29:56,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578988627] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:29:56,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:29:56,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 13:29:56,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396955259] [2022-07-20 13:29:56,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:29:56,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:29:56,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:29:56,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:29:56,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:29:56,396 INFO L87 Difference]: Start difference. First operand 1227 states and 1327 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:29:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:29:58,183 INFO L93 Difference]: Finished difference Result 1694 states and 1828 transitions. [2022-07-20 13:29:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:29:58,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 13:29:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:29:58,188 INFO L225 Difference]: With dead ends: 1694 [2022-07-20 13:29:58,188 INFO L226 Difference]: Without dead ends: 1694 [2022-07-20 13:29:58,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:29:58,189 INFO L413 NwaCegarLoop]: 1421 mSDtfsCounter, 684 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 13:29:58,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 2010 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-20 13:29:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2022-07-20 13:29:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1469. [2022-07-20 13:29:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 887 states have (on average 2.0056369785794814) internal successors, (1779), 1457 states have internal predecessors, (1779), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-20 13:29:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1825 transitions. [2022-07-20 13:29:58,207 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1825 transitions. Word has length 8 [2022-07-20 13:29:58,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:29:58,207 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 1825 transitions. [2022-07-20 13:29:58,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:29:58,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1825 transitions. [2022-07-20 13:29:58,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 13:29:58,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:29:58,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:29:58,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 13:29:58,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:29:58,414 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:29:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:29:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1255764539, now seen corresponding path program 1 times [2022-07-20 13:29:58,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:29:58,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089622348] [2022-07-20 13:29:58,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:29:58,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:29:58,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:29:58,416 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:29:58,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 13:29:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:29:58,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:29:58,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:29:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:29:58,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:29:58,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:29:58,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089622348] [2022-07-20 13:29:58,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089622348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:29:58,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:29:58,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:29:58,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811916776] [2022-07-20 13:29:58,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:29:58,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:29:58,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:29:58,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:29:58,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:29:58,562 INFO L87 Difference]: Start difference. First operand 1469 states and 1825 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:29:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:29:58,810 INFO L93 Difference]: Finished difference Result 2286 states and 2860 transitions. [2022-07-20 13:29:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:29:58,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 13:29:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:29:58,816 INFO L225 Difference]: With dead ends: 2286 [2022-07-20 13:29:58,816 INFO L226 Difference]: Without dead ends: 2286 [2022-07-20 13:29:58,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:29:58,817 INFO L413 NwaCegarLoop]: 1443 mSDtfsCounter, 748 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 13:29:58,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 2563 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 13:29:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2022-07-20 13:29:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 1869. [2022-07-20 13:29:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1285 states have (on average 1.9883268482490273) internal successors, (2555), 1855 states have internal predecessors, (2555), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-20 13:29:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2605 transitions. [2022-07-20 13:29:58,844 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2605 transitions. Word has length 11 [2022-07-20 13:29:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:29:58,844 INFO L495 AbstractCegarLoop]: Abstraction has 1869 states and 2605 transitions. [2022-07-20 13:29:58,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:29:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2605 transitions. [2022-07-20 13:29:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 13:29:58,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:29:58,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:29:58,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 13:29:59,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:29:59,052 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr344REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:29:59,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:29:59,052 INFO L85 PathProgramCache]: Analyzing trace with hash -680989669, now seen corresponding path program 1 times [2022-07-20 13:29:59,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:29:59,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361271145] [2022-07-20 13:29:59,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:29:59,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:29:59,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:29:59,054 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:29:59,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 13:29:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:29:59,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 13:29:59,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:29:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:29:59,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:29:59,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:29:59,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361271145] [2022-07-20 13:29:59,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361271145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:29:59,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:29:59,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:29:59,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065253465] [2022-07-20 13:29:59,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:29:59,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:29:59,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:29:59,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:29:59,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:29:59,173 INFO L87 Difference]: Start difference. First operand 1869 states and 2605 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:29:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:29:59,197 INFO L93 Difference]: Finished difference Result 1992 states and 2665 transitions. [2022-07-20 13:29:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:29:59,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 13:29:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:29:59,203 INFO L225 Difference]: With dead ends: 1992 [2022-07-20 13:29:59,203 INFO L226 Difference]: Without dead ends: 1992 [2022-07-20 13:29:59,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:29:59,204 INFO L413 NwaCegarLoop]: 1462 mSDtfsCounter, 585 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 2352 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-07-20 13:29:59,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 2352 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:29:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2022-07-20 13:29:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1773. [2022-07-20 13:29:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1213 states have (on average 1.964550700741962) internal successors, (2383), 1759 states have internal predecessors, (2383), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-20 13:29:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2433 transitions. [2022-07-20 13:29:59,247 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2433 transitions. Word has length 13 [2022-07-20 13:29:59,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:29:59,248 INFO L495 AbstractCegarLoop]: Abstraction has 1773 states and 2433 transitions. [2022-07-20 13:29:59,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:29:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2433 transitions. [2022-07-20 13:29:59,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 13:29:59,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:29:59,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:29:59,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 13:29:59,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:29:59,456 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr639ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:29:59,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:29:59,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1323693751, now seen corresponding path program 1 times [2022-07-20 13:29:59,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:29:59,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850881583] [2022-07-20 13:29:59,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:29:59,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:29:59,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:29:59,458 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:29:59,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 13:29:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:29:59,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 13:29:59,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:29:59,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 13:29:59,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 13:29:59,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 13:29:59,619 INFO L356 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2022-07-20 13:29:59,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 36 [2022-07-20 13:29:59,647 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-20 13:29:59,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 23 [2022-07-20 13:29:59,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:29:59,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:29:59,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:29:59,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850881583] [2022-07-20 13:29:59,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850881583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:29:59,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:29:59,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:29:59,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393568019] [2022-07-20 13:29:59,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:29:59,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:29:59,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:29:59,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:29:59,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:29:59,658 INFO L87 Difference]: Start difference. First operand 1773 states and 2433 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:30:00,551 INFO L93 Difference]: Finished difference Result 2415 states and 3336 transitions. [2022-07-20 13:30:00,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:30:00,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 13:30:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:30:00,556 INFO L225 Difference]: With dead ends: 2415 [2022-07-20 13:30:00,556 INFO L226 Difference]: Without dead ends: 2415 [2022-07-20 13:30:00,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-07-20 13:30:00,557 INFO L413 NwaCegarLoop]: 1219 mSDtfsCounter, 461 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 13:30:00,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 3538 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-20 13:30:00,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2022-07-20 13:30:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 1772. [2022-07-20 13:30:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1212 states have (on average 1.9645214521452146) internal successors, (2381), 1758 states have internal predecessors, (2381), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-20 13:30:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2431 transitions. [2022-07-20 13:30:00,579 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2431 transitions. Word has length 14 [2022-07-20 13:30:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:30:00,579 INFO L495 AbstractCegarLoop]: Abstraction has 1772 states and 2431 transitions. [2022-07-20 13:30:00,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2431 transitions. [2022-07-20 13:30:00,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 13:30:00,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:30:00,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:30:00,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-20 13:30:00,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:30:00,787 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:30:00,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:30:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash -413650658, now seen corresponding path program 1 times [2022-07-20 13:30:00,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:30:00,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64944601] [2022-07-20 13:30:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:30:00,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:30:00,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:30:00,789 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:30:00,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-20 13:30:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:30:00,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 13:30:00,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:30:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:00,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:30:00,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:30:00,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64944601] [2022-07-20 13:30:00,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64944601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:30:00,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:30:00,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:30:00,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110082107] [2022-07-20 13:30:00,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:30:00,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:30:00,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:30:00,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:30:00,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:30:00,949 INFO L87 Difference]: Start difference. First operand 1772 states and 2431 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:30:00,972 INFO L93 Difference]: Finished difference Result 1712 states and 2345 transitions. [2022-07-20 13:30:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:30:00,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 13:30:00,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:30:00,977 INFO L225 Difference]: With dead ends: 1712 [2022-07-20 13:30:00,978 INFO L226 Difference]: Without dead ends: 1712 [2022-07-20 13:30:00,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:30:00,980 INFO L413 NwaCegarLoop]: 1219 mSDtfsCounter, 1131 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1311 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-07-20 13:30:00,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 1311 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:30:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-07-20 13:30:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1712. [2022-07-20 13:30:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1176 states have (on average 1.9515306122448979) internal successors, (2295), 1698 states have internal predecessors, (2295), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-20 13:30:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2345 transitions. [2022-07-20 13:30:01,005 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2345 transitions. Word has length 18 [2022-07-20 13:30:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:30:01,006 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 2345 transitions. [2022-07-20 13:30:01,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2345 transitions. [2022-07-20 13:30:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 13:30:01,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:30:01,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:30:01,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-20 13:30:01,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:30:01,214 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:30:01,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:30:01,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1913675577, now seen corresponding path program 1 times [2022-07-20 13:30:01,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:30:01,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601551353] [2022-07-20 13:30:01,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:30:01,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:30:01,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:30:01,217 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:30:01,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-20 13:30:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:30:01,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:30:01,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:30:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:01,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:30:01,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:30:01,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601551353] [2022-07-20 13:30:01,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601551353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:30:01,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:30:01,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:30:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352680744] [2022-07-20 13:30:01,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:30:01,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:30:01,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:30:01,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:30:01,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:30:01,380 INFO L87 Difference]: Start difference. First operand 1712 states and 2345 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:30:01,426 INFO L93 Difference]: Finished difference Result 1684 states and 2289 transitions. [2022-07-20 13:30:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:30:01,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 13:30:01,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:30:01,430 INFO L225 Difference]: With dead ends: 1684 [2022-07-20 13:30:01,430 INFO L226 Difference]: Without dead ends: 1684 [2022-07-20 13:30:01,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:30:01,431 INFO L413 NwaCegarLoop]: 1174 mSDtfsCounter, 1102 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 2433 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:30:01,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 2433 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:30:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-07-20 13:30:01,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1682. [2022-07-20 13:30:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1160 states have (on average 1.928448275862069) internal successors, (2237), 1668 states have internal predecessors, (2237), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-20 13:30:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2287 transitions. [2022-07-20 13:30:01,451 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2287 transitions. Word has length 20 [2022-07-20 13:30:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:30:01,451 INFO L495 AbstractCegarLoop]: Abstraction has 1682 states and 2287 transitions. [2022-07-20 13:30:01,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2287 transitions. [2022-07-20 13:30:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 13:30:01,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:30:01,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:30:01,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-20 13:30:01,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:30:01,663 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:30:01,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:30:01,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753126, now seen corresponding path program 1 times [2022-07-20 13:30:01,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:30:01,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564264009] [2022-07-20 13:30:01,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:30:01,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:30:01,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:30:01,666 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:30:01,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 13:30:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:30:01,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 13:30:01,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:30:01,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:30:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:01,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:30:01,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:30:01,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564264009] [2022-07-20 13:30:01,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564264009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:30:01,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:30:01,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:30:01,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171347127] [2022-07-20 13:30:01,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:30:01,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:30:01,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:30:01,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:30:01,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:30:01,862 INFO L87 Difference]: Start difference. First operand 1682 states and 2287 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:30:03,397 INFO L93 Difference]: Finished difference Result 2541 states and 3552 transitions. [2022-07-20 13:30:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 13:30:03,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 13:30:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:30:03,409 INFO L225 Difference]: With dead ends: 2541 [2022-07-20 13:30:03,409 INFO L226 Difference]: Without dead ends: 2541 [2022-07-20 13:30:03,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:30:03,410 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 2164 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-20 13:30:03,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 1290 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-20 13:30:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2022-07-20 13:30:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 1678. [2022-07-20 13:30:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1160 states have (on average 1.921551724137931) internal successors, (2229), 1664 states have internal predecessors, (2229), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-20 13:30:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2279 transitions. [2022-07-20 13:30:03,430 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2279 transitions. Word has length 34 [2022-07-20 13:30:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:30:03,431 INFO L495 AbstractCegarLoop]: Abstraction has 1678 states and 2279 transitions. [2022-07-20 13:30:03,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2279 transitions. [2022-07-20 13:30:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 13:30:03,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:30:03,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:30:03,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 13:30:03,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:30:03,642 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:30:03,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:30:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753127, now seen corresponding path program 1 times [2022-07-20 13:30:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:30:03,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3224394] [2022-07-20 13:30:03,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:30:03,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:30:03,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:30:03,645 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:30:03,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-20 13:30:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:30:03,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 13:30:03,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:30:03,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:30:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:03,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:30:03,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:30:03,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3224394] [2022-07-20 13:30:03,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3224394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:30:03,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:30:03,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:30:03,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153339611] [2022-07-20 13:30:03,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:30:03,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:30:03,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:30:03,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:30:03,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:30:03,890 INFO L87 Difference]: Start difference. First operand 1678 states and 2279 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:30:06,302 INFO L93 Difference]: Finished difference Result 2089 states and 2498 transitions. [2022-07-20 13:30:06,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 13:30:06,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 13:30:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:30:06,307 INFO L225 Difference]: With dead ends: 2089 [2022-07-20 13:30:06,307 INFO L226 Difference]: Without dead ends: 2089 [2022-07-20 13:30:06,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:30:06,308 INFO L413 NwaCegarLoop]: 1521 mSDtfsCounter, 1298 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 13:30:06,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 2787 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 13:30:06,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2022-07-20 13:30:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1674. [2022-07-20 13:30:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1160 states have (on average 1.914655172413793) internal successors, (2221), 1660 states have internal predecessors, (2221), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-20 13:30:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2271 transitions. [2022-07-20 13:30:06,324 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2271 transitions. Word has length 34 [2022-07-20 13:30:06,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:30:06,324 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 2271 transitions. [2022-07-20 13:30:06,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2271 transitions. [2022-07-20 13:30:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 13:30:06,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:30:06,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:30:06,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-20 13:30:06,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:30:06,533 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:30:06,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:30:06,533 INFO L85 PathProgramCache]: Analyzing trace with hash -515146363, now seen corresponding path program 1 times [2022-07-20 13:30:06,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:30:06,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962954634] [2022-07-20 13:30:06,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:30:06,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:30:06,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:30:06,535 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:30:06,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-20 13:30:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:30:06,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:30:06,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:30:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:06,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:30:06,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:30:06,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962954634] [2022-07-20 13:30:06,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962954634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:30:06,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:30:06,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:30:06,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926657843] [2022-07-20 13:30:06,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:30:06,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:30:06,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:30:06,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:30:06,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:30:06,749 INFO L87 Difference]: Start difference. First operand 1674 states and 2271 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:30:06,789 INFO L93 Difference]: Finished difference Result 1662 states and 2251 transitions. [2022-07-20 13:30:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:30:06,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-20 13:30:06,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:30:06,799 INFO L225 Difference]: With dead ends: 1662 [2022-07-20 13:30:06,799 INFO L226 Difference]: Without dead ends: 1662 [2022-07-20 13:30:06,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:30:06,801 INFO L413 NwaCegarLoop]: 1168 mSDtfsCounter, 1078 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:30:06,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 2411 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:30:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2022-07-20 13:30:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1662. [2022-07-20 13:30:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1148 states have (on average 1.9172473867595818) internal successors, (2201), 1648 states have internal predecessors, (2201), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-20 13:30:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2251 transitions. [2022-07-20 13:30:06,821 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2251 transitions. Word has length 52 [2022-07-20 13:30:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:30:06,823 INFO L495 AbstractCegarLoop]: Abstraction has 1662 states and 2251 transitions. [2022-07-20 13:30:06,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2251 transitions. [2022-07-20 13:30:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 13:30:06,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:30:06,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-20 13:30:06,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-20 13:30:07,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:30:07,034 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:30:07,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:30:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1189287633, now seen corresponding path program 1 times [2022-07-20 13:30:07,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:30:07,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350705136] [2022-07-20 13:30:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:30:07,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:30:07,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:30:07,037 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:30:07,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-20 13:30:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:30:07,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 13:30:07,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:30:07,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:30:07,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:30:07,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 13:30:07,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 13:30:07,559 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 13:30:07,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 13:30:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:07,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:30:07,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:30:07,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350705136] [2022-07-20 13:30:07,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350705136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:30:07,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:30:07,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:30:07,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475612281] [2022-07-20 13:30:07,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:30:07,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:30:07,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:30:07,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:30:07,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:30:07,570 INFO L87 Difference]: Start difference. First operand 1662 states and 2251 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:08,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:30:08,970 INFO L93 Difference]: Finished difference Result 1633 states and 2223 transitions. [2022-07-20 13:30:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:30:08,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-07-20 13:30:08,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:30:08,974 INFO L225 Difference]: With dead ends: 1633 [2022-07-20 13:30:08,974 INFO L226 Difference]: Without dead ends: 1633 [2022-07-20 13:30:08,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:30:08,974 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 833 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 13:30:08,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 888 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-20 13:30:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-07-20 13:30:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1250. [2022-07-20 13:30:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 779 states have (on average 1.8318356867779204) internal successors, (1427), 1239 states have internal predecessors, (1427), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-20 13:30:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1471 transitions. [2022-07-20 13:30:08,986 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1471 transitions. Word has length 60 [2022-07-20 13:30:08,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:30:08,986 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1471 transitions. [2022-07-20 13:30:08,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1471 transitions. [2022-07-20 13:30:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-20 13:30:08,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:30:08,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:30:08,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-20 13:30:09,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:30:09,197 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:30:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:30:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054235, now seen corresponding path program 1 times [2022-07-20 13:30:09,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:30:09,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311359027] [2022-07-20 13:30:09,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:30:09,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:30:09,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:30:09,200 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:30:09,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-20 13:30:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:30:09,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 13:30:09,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:30:09,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:30:09,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:30:09,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 13:30:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:09,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:30:09,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:30:09,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311359027] [2022-07-20 13:30:09,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311359027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:30:09,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:30:09,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:30:09,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581372676] [2022-07-20 13:30:09,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:30:09,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 13:30:09,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:30:09,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 13:30:09,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:30:09,471 INFO L87 Difference]: Start difference. First operand 1250 states and 1471 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:30:11,067 INFO L93 Difference]: Finished difference Result 1249 states and 1470 transitions. [2022-07-20 13:30:11,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 13:30:11,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-20 13:30:11,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:30:11,070 INFO L225 Difference]: With dead ends: 1249 [2022-07-20 13:30:11,070 INFO L226 Difference]: Without dead ends: 1249 [2022-07-20 13:30:11,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 13:30:11,070 INFO L413 NwaCegarLoop]: 1126 mSDtfsCounter, 4 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2957 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-20 13:30:11,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2957 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-20 13:30:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2022-07-20 13:30:11,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2022-07-20 13:30:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 779 states have (on average 1.8305519897304237) internal successors, (1426), 1238 states have internal predecessors, (1426), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-20 13:30:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1470 transitions. [2022-07-20 13:30:11,089 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1470 transitions. Word has length 65 [2022-07-20 13:30:11,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:30:11,090 INFO L495 AbstractCegarLoop]: Abstraction has 1249 states and 1470 transitions. [2022-07-20 13:30:11,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:11,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1470 transitions. [2022-07-20 13:30:11,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-20 13:30:11,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:30:11,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:30:11,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-20 13:30:11,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:30:11,299 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:30:11,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:30:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054234, now seen corresponding path program 1 times [2022-07-20 13:30:11,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:30:11,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667971727] [2022-07-20 13:30:11,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:30:11,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:30:11,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:30:11,301 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:30:11,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-20 13:30:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:30:11,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 13:30:11,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:30:11,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:30:11,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:30:11,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:30:11,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 13:30:11,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 13:30:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:11,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:30:11,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:30:11,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667971727] [2022-07-20 13:30:11,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667971727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:30:11,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:30:11,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:30:11,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555566124] [2022-07-20 13:30:11,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:30:11,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 13:30:11,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:30:11,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 13:30:11,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:30:11,609 INFO L87 Difference]: Start difference. First operand 1249 states and 1470 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:30:13,704 INFO L93 Difference]: Finished difference Result 1248 states and 1469 transitions. [2022-07-20 13:30:13,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 13:30:13,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-20 13:30:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:30:13,707 INFO L225 Difference]: With dead ends: 1248 [2022-07-20 13:30:13,707 INFO L226 Difference]: Without dead ends: 1248 [2022-07-20 13:30:13,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 13:30:13,708 INFO L413 NwaCegarLoop]: 1126 mSDtfsCounter, 2 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3018 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-20 13:30:13,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3018 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-20 13:30:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-07-20 13:30:13,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1248. [2022-07-20 13:30:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 778 states have (on average 1.8316195372750643) internal successors, (1425), 1237 states have internal predecessors, (1425), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-20 13:30:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1469 transitions. [2022-07-20 13:30:13,718 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1469 transitions. Word has length 65 [2022-07-20 13:30:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:30:13,718 INFO L495 AbstractCegarLoop]: Abstraction has 1248 states and 1469 transitions. [2022-07-20 13:30:13,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:30:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1469 transitions. [2022-07-20 13:30:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-20 13:30:13,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:30:13,719 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-07-20 13:30:13,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-20 13:30:13,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:30:13,928 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:30:13,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:30:13,929 INFO L85 PathProgramCache]: Analyzing trace with hash 827014060, now seen corresponding path program 1 times [2022-07-20 13:30:13,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:30:13,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35579666] [2022-07-20 13:30:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:30:13,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:30:13,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:30:13,930 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:30:13,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-20 13:30:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:30:14,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:30:14,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:30:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:14,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:30:14,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:30:14,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35579666] [2022-07-20 13:30:14,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35579666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:30:14,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:30:14,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:30:14,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604753913] [2022-07-20 13:30:14,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:30:14,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:30:14,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:30:14,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:30:14,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:30:14,181 INFO L87 Difference]: Start difference. First operand 1248 states and 1469 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 13:30:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:30:14,214 INFO L93 Difference]: Finished difference Result 1251 states and 1473 transitions. [2022-07-20 13:30:14,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:30:14,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-07-20 13:30:14,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:30:14,220 INFO L225 Difference]: With dead ends: 1251 [2022-07-20 13:30:14,220 INFO L226 Difference]: Without dead ends: 1251 [2022-07-20 13:30:14,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:30:14,220 INFO L413 NwaCegarLoop]: 1126 mSDtfsCounter, 2 mSDsluCounter, 2247 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3373 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:30:14,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3373 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:30:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2022-07-20 13:30:14,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2022-07-20 13:30:14,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 780 states have (on average 1.8307692307692307) internal successors, (1428), 1240 states have internal predecessors, (1428), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-20 13:30:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1473 transitions. [2022-07-20 13:30:14,252 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1473 transitions. Word has length 73 [2022-07-20 13:30:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:30:14,252 INFO L495 AbstractCegarLoop]: Abstraction has 1251 states and 1473 transitions. [2022-07-20 13:30:14,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 13:30:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1473 transitions. [2022-07-20 13:30:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-20 13:30:14,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:30:14,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:30:14,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-20 13:30:14,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:30:14,465 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:30:14,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:30:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash 505961995, now seen corresponding path program 1 times [2022-07-20 13:30:14,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:30:14,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243132990] [2022-07-20 13:30:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:30:14,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:30:14,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:30:14,468 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:30:14,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-20 13:30:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:30:14,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 13:30:14,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:30:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:14,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:30:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:14,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:30:14,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243132990] [2022-07-20 13:30:14,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243132990] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 13:30:14,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:30:14,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 13:30:14,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228800438] [2022-07-20 13:30:14,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:30:14,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 13:30:14,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:30:14,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 13:30:14,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 13:30:14,772 INFO L87 Difference]: Start difference. First operand 1251 states and 1473 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:30:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:30:14,899 INFO L93 Difference]: Finished difference Result 1263 states and 1490 transitions. [2022-07-20 13:30:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 13:30:14,900 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2022-07-20 13:30:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:30:14,902 INFO L225 Difference]: With dead ends: 1263 [2022-07-20 13:30:14,902 INFO L226 Difference]: Without dead ends: 1263 [2022-07-20 13:30:14,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-20 13:30:14,903 INFO L413 NwaCegarLoop]: 1127 mSDtfsCounter, 15 mSDsluCounter, 4491 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5618 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 13:30:14,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5618 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 13:30:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2022-07-20 13:30:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1261. [2022-07-20 13:30:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 789 states have (on average 1.8288973384030418) internal successors, (1443), 1249 states have internal predecessors, (1443), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-20 13:30:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1488 transitions. [2022-07-20 13:30:14,913 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1488 transitions. Word has length 74 [2022-07-20 13:30:14,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:30:14,914 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1488 transitions. [2022-07-20 13:30:14,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:30:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1488 transitions. [2022-07-20 13:30:14,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 13:30:14,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:30:14,914 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:30:14,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-20 13:30:15,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:30:15,124 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:30:15,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:30:15,125 INFO L85 PathProgramCache]: Analyzing trace with hash 279993196, now seen corresponding path program 2 times [2022-07-20 13:30:15,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:30:15,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740279967] [2022-07-20 13:30:15,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 13:30:15,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:30:15,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:30:15,126 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:30:15,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-20 13:30:15,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 13:30:15,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:30:15,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 13:30:15,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:30:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:15,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:30:15,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:15,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:30:15,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740279967] [2022-07-20 13:30:15,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740279967] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 13:30:15,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:30:15,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-20 13:30:15,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786232584] [2022-07-20 13:30:15,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:30:15,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 13:30:15,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:30:15,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 13:30:15,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-20 13:30:15,663 INFO L87 Difference]: Start difference. First operand 1261 states and 1488 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:30:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:30:16,084 INFO L93 Difference]: Finished difference Result 1282 states and 1516 transitions. [2022-07-20 13:30:16,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 13:30:16,085 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2022-07-20 13:30:16,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:30:16,086 INFO L225 Difference]: With dead ends: 1282 [2022-07-20 13:30:16,086 INFO L226 Difference]: Without dead ends: 1278 [2022-07-20 13:30:16,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-20 13:30:16,087 INFO L413 NwaCegarLoop]: 1130 mSDtfsCounter, 62 mSDsluCounter, 5634 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 6764 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 13:30:16,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 6764 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 13:30:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2022-07-20 13:30:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1270. [2022-07-20 13:30:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 798 states have (on average 1.8233082706766917) internal successors, (1455), 1258 states have internal predecessors, (1455), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-20 13:30:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1500 transitions. [2022-07-20 13:30:16,097 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1500 transitions. Word has length 77 [2022-07-20 13:30:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:30:16,098 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1500 transitions. [2022-07-20 13:30:16,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:30:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1500 transitions. [2022-07-20 13:30:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-20 13:30:16,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:30:16,098 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:30:16,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-20 13:30:16,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:30:16,307 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:30:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:30:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash -183892212, now seen corresponding path program 3 times [2022-07-20 13:30:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:30:16,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453324689] [2022-07-20 13:30:16,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 13:30:16,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:30:16,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:30:16,309 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:30:16,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-20 13:30:16,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-20 13:30:16,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:30:16,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 13:30:16,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:30:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:16,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:30:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:17,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:30:17,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453324689] [2022-07-20 13:30:17,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453324689] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 13:30:17,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:30:17,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-20 13:30:17,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101188778] [2022-07-20 13:30:17,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:30:17,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 13:30:17,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:30:17,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 13:30:17,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-20 13:30:17,466 INFO L87 Difference]: Start difference. First operand 1270 states and 1500 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:30:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:30:19,849 INFO L93 Difference]: Finished difference Result 1312 states and 1562 transitions. [2022-07-20 13:30:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-20 13:30:19,850 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2022-07-20 13:30:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:30:19,852 INFO L225 Difference]: With dead ends: 1312 [2022-07-20 13:30:19,852 INFO L226 Difference]: Without dead ends: 1306 [2022-07-20 13:30:19,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-20 13:30:19,853 INFO L413 NwaCegarLoop]: 1135 mSDtfsCounter, 181 mSDsluCounter, 13562 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 14697 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 13:30:19,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 14697 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 13:30:19,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2022-07-20 13:30:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1288. [2022-07-20 13:30:19,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 816 states have (on average 1.8112745098039216) internal successors, (1478), 1276 states have internal predecessors, (1478), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-20 13:30:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1523 transitions. [2022-07-20 13:30:19,864 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1523 transitions. Word has length 83 [2022-07-20 13:30:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:30:19,865 INFO L495 AbstractCegarLoop]: Abstraction has 1288 states and 1523 transitions. [2022-07-20 13:30:19,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:30:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1523 transitions. [2022-07-20 13:30:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-20 13:30:19,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:30:19,866 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:30:19,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-20 13:30:20,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:30:20,077 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:30:20,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:30:20,079 INFO L85 PathProgramCache]: Analyzing trace with hash 171030092, now seen corresponding path program 4 times [2022-07-20 13:30:20,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:30:20,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043525845] [2022-07-20 13:30:20,080 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 13:30:20,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:30:20,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:30:20,081 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:30:20,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-20 13:30:20,374 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 13:30:20,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:30:20,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 13:30:20,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:30:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:20,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:30:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 13:30:21,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:30:21,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043525845] [2022-07-20 13:30:21,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043525845] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 13:30:21,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:30:21,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-20 13:30:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469069702] [2022-07-20 13:30:21,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:30:21,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-20 13:30:21,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:30:21,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-20 13:30:21,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-20 13:30:21,886 INFO L87 Difference]: Start difference. First operand 1288 states and 1523 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:30:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:30:30,613 INFO L93 Difference]: Finished difference Result 1368 states and 1635 transitions. [2022-07-20 13:30:30,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-20 13:30:30,613 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2022-07-20 13:30:30,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:30:30,615 INFO L225 Difference]: With dead ends: 1368 [2022-07-20 13:30:30,615 INFO L226 Difference]: Without dead ends: 1364 [2022-07-20 13:30:30,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-20 13:30:30,618 INFO L413 NwaCegarLoop]: 1147 mSDtfsCounter, 369 mSDsluCounter, 27415 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 28562 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:30:30,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 28562 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-20 13:30:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-07-20 13:30:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1322. [2022-07-20 13:30:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 850 states have (on average 1.7929411764705883) internal successors, (1524), 1310 states have internal predecessors, (1524), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-20 13:30:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1569 transitions. [2022-07-20 13:30:30,631 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1569 transitions. Word has length 95 [2022-07-20 13:30:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:30:30,632 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 1569 transitions. [2022-07-20 13:30:30,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:30:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1569 transitions. [2022-07-20 13:30:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-20 13:30:30,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:30:30,633 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:30:30,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-20 13:30:30,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:30:30,844 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:30:30,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:30:30,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1801422612, now seen corresponding path program 5 times [2022-07-20 13:30:30,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:30:30,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775745077] [2022-07-20 13:30:30,845 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 13:30:30,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:30:30,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:30:30,846 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:30:30,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-20 13:30:31,953 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-20 13:30:31,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:30:31,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-20 13:30:31,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:30:32,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:30:32,070 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 13:30:32,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 13:30:32,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:30:32,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 13:30:32,648 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927)))) is different from true [2022-07-20 13:30:33,147 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:30:33,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-20 13:30:33,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 13:30:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-07-20 13:30:33,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:30:33,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:30:33,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775745077] [2022-07-20 13:30:33,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775745077] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:30:33,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [360915870] [2022-07-20 13:30:33,396 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 13:30:33,396 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 13:30:33,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 13:30:33,397 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 13:30:33,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-07-20 13:32:00,025 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-20 13:32:00,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:32:00,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-20 13:32:00,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:32:00,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:32:00,309 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 13:32:00,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 13:32:00,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:32:00,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 13:32:00,423 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2373)))) is different from true [2022-07-20 13:32:00,529 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:32:00,555 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2381)))) is different from true [2022-07-20 13:32:00,633 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386)))) is different from true [2022-07-20 13:32:00,642 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2387) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:32:00,758 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394)))) is different from true [2022-07-20 13:32:00,964 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406)))) is different from true [2022-07-20 13:32:00,973 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2407)))) is different from true [2022-07-20 13:32:01,147 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:32:01,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-20 13:32:01,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 13:32:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 324 not checked. [2022-07-20 13:32:01,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:32:01,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [360915870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:32:01,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:32:01,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 17 [2022-07-20 13:32:01,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031070577] [2022-07-20 13:32:01,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:32:01,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 13:32:01,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:32:01,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 13:32:01,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=103, Unknown=18, NotChecked=252, Total=420 [2022-07-20 13:32:01,349 INFO L87 Difference]: Start difference. First operand 1322 states and 1569 transitions. Second operand has 18 states, 16 states have (on average 5.5625) internal successors, (89), 18 states have internal predecessors, (89), 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-07-20 13:32:01,535 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_1908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1908))) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406))) (exists ((v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2381))) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386))) (exists ((v_ArrVal_2373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2373)))) is different from true [2022-07-20 13:32:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:32:03,605 INFO L93 Difference]: Finished difference Result 1333 states and 1579 transitions. [2022-07-20 13:32:03,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 13:32:03,605 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.5625) internal successors, (89), 18 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-07-20 13:32:03,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:32:03,607 INFO L225 Difference]: With dead ends: 1333 [2022-07-20 13:32:03,607 INFO L226 Difference]: Without dead ends: 1329 [2022-07-20 13:32:03,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 138 SyntacticMatches, 84 SemanticMatches, 22 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=62, Invalid=139, Unknown=21, NotChecked=330, Total=552 [2022-07-20 13:32:03,608 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 758 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 3814 SdHoareTripleChecker+Invalid, 14360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12360 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 13:32:03,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 3814 Invalid, 14360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1992 Invalid, 0 Unknown, 12360 Unchecked, 2.2s Time] [2022-07-20 13:32:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-20 13:32:03,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1321. [2022-07-20 13:32:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 850 states have (on average 1.7870588235294118) internal successors, (1519), 1309 states have internal predecessors, (1519), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-20 13:32:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1564 transitions. [2022-07-20 13:32:03,618 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1564 transitions. Word has length 117 [2022-07-20 13:32:03,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:32:03,618 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1564 transitions. [2022-07-20 13:32:03,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.5625) internal successors, (89), 18 states have internal predecessors, (89), 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-07-20 13:32:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1564 transitions. [2022-07-20 13:32:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-20 13:32:03,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:32:03,619 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:32:03,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2022-07-20 13:32:03,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-20 13:32:04,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 13:32:04,032 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-20 13:32:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:32:04,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1801422611, now seen corresponding path program 1 times [2022-07-20 13:32:04,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:32:04,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449317424] [2022-07-20 13:32:04,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:32:04,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:32:04,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:32:04,034 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 13:32:04,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-20 13:32:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:32:04,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-20 13:32:04,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:32:04,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:32:04,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:32:04,752 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 13:32:04,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 13:32:04,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:32:04,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:32:04,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 13:32:04,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-20 13:32:04,892 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2838))) (exists ((v_ArrVal_2839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2839))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-20 13:32:04,968 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2848))) (exists ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2849) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-20 13:32:04,974 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850))) (exists ((v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2851) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:32:04,981 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2852)))) is different from true [2022-07-20 13:32:05,005 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2856))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-20 13:32:05,012 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2859) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:32:05,107 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2870) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2871)))) is different from true [2022-07-20 13:32:05,113 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2872) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2873 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2873))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-20 13:32:05,156 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:32:05,163 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2881))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:32:05,206 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2886 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2886) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887)))) is different from true [2022-07-20 13:32:05,264 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2895 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2895) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2894)))) is different from true [2022-07-20 13:32:05,271 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2896))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2897)))) is different from true [2022-07-20 13:32:05,277 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2898 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2898)))) is different from true [2022-07-20 13:32:05,303 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2902 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2902) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2903)))) is different from true [2022-07-20 13:32:05,344 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2909))) (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:32:05,384 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2914) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2915) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:32:05,390 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2917))) (exists ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2916)))) is different from true [2022-07-20 13:32:05,397 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2919))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-20 13:32:05,403 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2921) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2920)))) is different from true [2022-07-20 13:32:05,442 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:32:05,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-20 13:32:05,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 13:32:05,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 13:32:05,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 13:32:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 690 not checked. [2022-07-20 13:32:05,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:32:06,026 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3014 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_3015 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3015) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1))))) is different from false [2022-07-20 13:32:06,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:32:06,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449317424] [2022-07-20 13:32:06,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449317424] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:32:06,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [958942638] [2022-07-20 13:32:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:32:06,031 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 13:32:06,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 13:32:06,032 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 13:32:06,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-07-20 13:34:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:34:15,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-20 13:34:15,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:34:15,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:34:15,797 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 13:34:15,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 13:34:15,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 13:34:15,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:34:15,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:34:15,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 13:34:15,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-20 13:34:15,887 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3392))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3391 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3391) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:34:15,910 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3396) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-20 13:34:15,984 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3406) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3405 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3405)))) is different from true [2022-07-20 13:34:16,009 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3410))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-20 13:34:16,097 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3421) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3422 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3422)))) is different from true [2022-07-20 13:34:16,156 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3430))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3429)))) is different from true [2022-07-20 13:34:16,179 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3433 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3433) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3434 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3434) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:34:16,213 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3438))) (exists ((v_ArrVal_3437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3437)))) is different from true [2022-07-20 13:34:16,235 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3442 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3442))) (exists ((v_ArrVal_3441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3441)))) is different from true [2022-07-20 13:34:16,257 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3446))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3445) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:34:16,303 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3452) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3451)))) is different from true [2022-07-20 13:34:16,341 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3458))) (exists ((v_ArrVal_3457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3457)))) is different from true [2022-07-20 13:34:16,362 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3461))) (exists ((v_ArrVal_3462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3462)))) is different from true [2022-07-20 13:34:16,424 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3469))) (exists ((v_ArrVal_3470 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3470))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-20 13:34:16,477 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3476))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3475)))) is different from true [2022-07-20 13:34:16,483 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3478))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3477)))) is different from true [2022-07-20 13:34:16,507 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:34:16,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-20 13:34:16,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 13:34:16,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 13:34:16,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 13:34:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 378 trivial. 584 not checked. [2022-07-20 13:34:16,539 INFO L328 TraceCheckSpWp]: Computing backward predicates...