./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 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_JEN_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 80f1df6d4bc7961b41bec7d16d328ef23e1639399b1fb3a18bcdda9891a98148 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 12:50:05,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 12:50:05,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 12:50:05,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 12:50:05,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 12:50:05,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 12:50:05,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 12:50:05,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 12:50:05,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 12:50:05,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 12:50:05,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 12:50:05,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 12:50:05,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 12:50:05,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 12:50:05,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 12:50:05,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 12:50:05,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 12:50:05,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 12:50:05,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 12:50:05,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 12:50:05,082 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 12:50:05,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 12:50:05,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 12:50:05,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 12:50:05,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 12:50:05,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 12:50:05,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 12:50:05,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 12:50:05,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 12:50:05,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 12:50:05,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 12:50:05,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 12:50:05,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 12:50:05,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 12:50:05,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 12:50:05,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 12:50:05,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 12:50:05,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 12:50:05,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 12:50:05,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 12:50:05,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 12:50:05,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 12:50:05,099 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 12:50:05,125 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 12:50:05,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 12:50:05,126 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 12:50:05,126 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 12:50:05,127 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 12:50:05,127 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 12:50:05,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 12:50:05,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 12:50:05,128 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 12:50:05,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 12:50:05,129 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 12:50:05,129 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 12:50:05,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 12:50:05,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 12:50:05,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 12:50:05,129 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 12:50:05,130 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 12:50:05,130 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 12:50:05,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 12:50:05,130 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 12:50:05,131 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 12:50:05,131 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 12:50:05,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 12:50:05,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 12:50:05,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 12:50:05,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:50:05,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 12:50:05,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 12:50:05,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 12:50:05,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 12:50:05,133 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 -> 80f1df6d4bc7961b41bec7d16d328ef23e1639399b1fb3a18bcdda9891a98148 [2022-07-23 12:50:05,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 12:50:05,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 12:50:05,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 12:50:05,350 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 12:50:05,350 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 12:50:05,351 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2022-07-23 12:50:05,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/931eb7768/8ee5c6d2ed354ebe9f6331cfd2b6da3f/FLAG2bb1ad07a [2022-07-23 12:50:05,871 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 12:50:05,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2022-07-23 12:50:05,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/931eb7768/8ee5c6d2ed354ebe9f6331cfd2b6da3f/FLAG2bb1ad07a [2022-07-23 12:50:05,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/931eb7768/8ee5c6d2ed354ebe9f6331cfd2b6da3f [2022-07-23 12:50:05,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 12:50:05,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 12:50:05,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 12:50:05,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 12:50:05,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 12:50:05,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:50:05" (1/1) ... [2022-07-23 12:50:05,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7876f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:05, skipping insertion in model container [2022-07-23 12:50:05,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:50:05" (1/1) ... [2022-07-23 12:50:05,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 12:50:05,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:50:06,270 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_JEN_test8-2.i[33021,33034] [2022-07-23 12:50:06,385 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_JEN_test8-2.i[45234,45247] [2022-07-23 12:50:06,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:50:06,421 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-23 12:50:06,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2210bb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:06, skipping insertion in model container [2022-07-23 12:50:06,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 12:50:06,424 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 12:50:06,426 INFO L158 Benchmark]: Toolchain (without parser) took 532.08ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 61.7MB in the beginning and 96.1MB in the end (delta: -34.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 12:50:06,427 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory was 51.1MB in the beginning and 51.1MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 12:50:06,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.29ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 61.5MB in the beginning and 96.1MB in the end (delta: -34.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 12:50:06,430 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.16ms. Allocated memory is still 94.4MB. Free memory was 51.1MB in the beginning and 51.1MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 530.29ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 61.5MB in the beginning and 96.1MB in the end (delta: -34.6MB). Peak memory consumption was 10.5MB. 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_JEN_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 80f1df6d4bc7961b41bec7d16d328ef23e1639399b1fb3a18bcdda9891a98148 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 12:50:07,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 12:50:07,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 12:50:08,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 12:50:08,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 12:50:08,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 12:50:08,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 12:50:08,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 12:50:08,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 12:50:08,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 12:50:08,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 12:50:08,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 12:50:08,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 12:50:08,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 12:50:08,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 12:50:08,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 12:50:08,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 12:50:08,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 12:50:08,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 12:50:08,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 12:50:08,037 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 12:50:08,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 12:50:08,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 12:50:08,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 12:50:08,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 12:50:08,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 12:50:08,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 12:50:08,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 12:50:08,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 12:50:08,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 12:50:08,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 12:50:08,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 12:50:08,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 12:50:08,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 12:50:08,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 12:50:08,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 12:50:08,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 12:50:08,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 12:50:08,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 12:50:08,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 12:50:08,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 12:50:08,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 12:50:08,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 12:50:08,071 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 12:50:08,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 12:50:08,073 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 12:50:08,073 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 12:50:08,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 12:50:08,074 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 12:50:08,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 12:50:08,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 12:50:08,075 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 12:50:08,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 12:50:08,076 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 12:50:08,076 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 12:50:08,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 12:50:08,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 12:50:08,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 12:50:08,077 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 12:50:08,077 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 12:50:08,077 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 12:50:08,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 12:50:08,077 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 12:50:08,078 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 12:50:08,078 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 12:50:08,078 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 12:50:08,078 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 12:50:08,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 12:50:08,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 12:50:08,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 12:50:08,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:50:08,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 12:50:08,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 12:50:08,080 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 12:50:08,080 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 12:50:08,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 12:50:08,080 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 -> 80f1df6d4bc7961b41bec7d16d328ef23e1639399b1fb3a18bcdda9891a98148 [2022-07-23 12:50:08,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 12:50:08,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 12:50:08,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 12:50:08,376 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 12:50:08,377 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 12:50:08,378 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2022-07-23 12:50:08,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3113dcdd/3079063b2ca0402c81db977b9c7a75eb/FLAGb9a5bff04 [2022-07-23 12:50:08,874 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 12:50:08,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2022-07-23 12:50:08,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3113dcdd/3079063b2ca0402c81db977b9c7a75eb/FLAGb9a5bff04 [2022-07-23 12:50:09,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3113dcdd/3079063b2ca0402c81db977b9c7a75eb [2022-07-23 12:50:09,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 12:50:09,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 12:50:09,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 12:50:09,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 12:50:09,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 12:50:09,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:50:09" (1/1) ... [2022-07-23 12:50:09,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66b3dba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:09, skipping insertion in model container [2022-07-23 12:50:09,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:50:09" (1/1) ... [2022-07-23 12:50:09,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 12:50:09,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:50:09,568 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_JEN_test8-2.i[33021,33034] [2022-07-23 12:50:09,664 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_JEN_test8-2.i[45234,45247] [2022-07-23 12:50:09,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:50:09,694 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 12:50:09,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:50:09,711 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_JEN_test8-2.i[33021,33034] [2022-07-23 12:50:09,760 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_JEN_test8-2.i[45234,45247] [2022-07-23 12:50:09,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:50:09,770 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 12:50:09,793 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_JEN_test8-2.i[33021,33034] [2022-07-23 12:50:09,828 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_JEN_test8-2.i[45234,45247] [2022-07-23 12:50:09,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:50:09,865 INFO L208 MainTranslator]: Completed translation [2022-07-23 12:50:09,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:09 WrapperNode [2022-07-23 12:50:09,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 12:50:09,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 12:50:09,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 12:50:09,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 12:50:09,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:09" (1/1) ... [2022-07-23 12:50:09,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:09" (1/1) ... [2022-07-23 12:50:09,960 INFO L137 Inliner]: procedures = 180, calls = 348, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1175 [2022-07-23 12:50:09,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 12:50:09,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 12:50:09,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 12:50:09,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 12:50:09,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:09" (1/1) ... [2022-07-23 12:50:09,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:09" (1/1) ... [2022-07-23 12:50:09,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:09" (1/1) ... [2022-07-23 12:50:09,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:09" (1/1) ... [2022-07-23 12:50:10,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:09" (1/1) ... [2022-07-23 12:50:10,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:09" (1/1) ... [2022-07-23 12:50:10,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:09" (1/1) ... [2022-07-23 12:50:10,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 12:50:10,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 12:50:10,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 12:50:10,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 12:50:10,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:09" (1/1) ... [2022-07-23 12:50:10,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:50:10,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 12:50:10,065 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-23 12:50:10,089 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-23 12:50:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-23 12:50:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 12:50:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-23 12:50:10,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-23 12:50:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-23 12:50:10,117 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-23 12:50:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2022-07-23 12:50:10,117 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2022-07-23 12:50:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 12:50:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 12:50:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 12:50:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 12:50:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-23 12:50:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 12:50:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 12:50:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 12:50:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 12:50:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 12:50:10,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 12:50:10,295 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 12:50:10,296 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 12:50:10,298 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 12:50:13,376 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 12:50:13,387 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 12:50:13,391 INFO L299 CfgBuilder]: Removed 71 assume(true) statements. [2022-07-23 12:50:13,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:50:13 BoogieIcfgContainer [2022-07-23 12:50:13,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 12:50:13,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 12:50:13,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 12:50:13,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 12:50:13,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:50:09" (1/3) ... [2022-07-23 12:50:13,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f5f641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:50:13, skipping insertion in model container [2022-07-23 12:50:13,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:50:09" (2/3) ... [2022-07-23 12:50:13,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f5f641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:50:13, skipping insertion in model container [2022-07-23 12:50:13,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:50:13" (3/3) ... [2022-07-23 12:50:13,403 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test8-2.i [2022-07-23 12:50:13,413 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 12:50:13,414 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 641 error locations. [2022-07-23 12:50:13,469 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 12:50:13,475 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@553540d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5850974 [2022-07-23 12:50:13,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 641 error locations. [2022-07-23 12:50:13,483 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-23 12:50:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 12:50:13,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:13,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 12:50:13,488 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-23 12:50:13,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:13,494 INFO L85 PathProgramCache]: Analyzing trace with hash 132136, now seen corresponding path program 1 times [2022-07-23 12:50:13,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:13,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93606078] [2022-07-23 12:50:13,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:13,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:13,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:13,527 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-23 12:50:13,529 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-23 12:50:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:13,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:50:13,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:13,700 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-23 12:50:13,725 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-23 12:50:13,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:13,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:13,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93606078] [2022-07-23 12:50:13,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93606078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:13,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:13,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:50:13,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992699572] [2022-07-23 12:50:13,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:13,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:50:13,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:13,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:50:13,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:50:13,766 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-23 12:50:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:15,301 INFO L93 Difference]: Finished difference Result 1476 states and 1582 transitions. [2022-07-23 12:50:15,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:50:15,304 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-23 12:50:15,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:15,344 INFO L225 Difference]: With dead ends: 1476 [2022-07-23 12:50:15,349 INFO L226 Difference]: Without dead ends: 1474 [2022-07-23 12:50:15,350 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-23 12:50:15,354 INFO L413 NwaCegarLoop]: 817 mSDtfsCounter, 1162 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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-23 12:50:15,355 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-23 12:50:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2022-07-23 12:50:15,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1285. [2022-07-23 12:50:15,428 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-23 12:50:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1387 transitions. [2022-07-23 12:50:15,433 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1387 transitions. Word has length 3 [2022-07-23 12:50:15,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:15,433 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 1387 transitions. [2022-07-23 12:50:15,434 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-23 12:50:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1387 transitions. [2022-07-23 12:50:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 12:50:15,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:15,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 12:50:15,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-23 12:50:15,642 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-23 12:50:15,643 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-23 12:50:15,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:15,644 INFO L85 PathProgramCache]: Analyzing trace with hash 132137, now seen corresponding path program 1 times [2022-07-23 12:50:15,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:15,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015681376] [2022-07-23 12:50:15,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:15,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:15,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:15,646 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-23 12:50:15,648 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-23 12:50:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:15,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:50:15,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:15,750 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-23 12:50:15,757 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-23 12:50:15,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:15,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:15,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015681376] [2022-07-23 12:50:15,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015681376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:15,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:15,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:50:15,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868200892] [2022-07-23 12:50:15,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:15,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:50:15,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:15,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:50:15,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:50:15,760 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-23 12:50:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:18,017 INFO L93 Difference]: Finished difference Result 1877 states and 2020 transitions. [2022-07-23 12:50:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:50:18,018 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-23 12:50:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:18,023 INFO L225 Difference]: With dead ends: 1877 [2022-07-23 12:50:18,023 INFO L226 Difference]: Without dead ends: 1877 [2022-07-23 12:50:18,023 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-23 12:50:18,024 INFO L413 NwaCegarLoop]: 1090 mSDtfsCounter, 631 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:50:18,024 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.2s Time] [2022-07-23 12:50:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2022-07-23 12:50:18,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1489. [2022-07-23 12:50:18,049 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-23 12:50:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1808 transitions. [2022-07-23 12:50:18,054 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1808 transitions. Word has length 3 [2022-07-23 12:50:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:18,054 INFO L495 AbstractCegarLoop]: Abstraction has 1489 states and 1808 transitions. [2022-07-23 12:50:18,054 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-23 12:50:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1808 transitions. [2022-07-23 12:50:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 12:50:18,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:18,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:50:18,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-23 12:50:18,261 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-23 12:50:18,262 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-23 12:50:18,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:18,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1773817970, now seen corresponding path program 1 times [2022-07-23 12:50:18,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:18,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225486451] [2022-07-23 12:50:18,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:18,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:18,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:18,272 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-23 12:50:18,273 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-23 12:50:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:18,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 12:50:18,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:18,440 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-23 12:50:18,445 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-23 12:50:18,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 12:50:18,480 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-23 12:50:18,487 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:50:18,487 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-23 12:50:18,505 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-23 12:50:18,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:18,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:18,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225486451] [2022-07-23 12:50:18,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225486451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:18,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:18,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:50:18,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132995523] [2022-07-23 12:50:18,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:18,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:50:18,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:18,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:50:18,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:50:18,508 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-23 12:50:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:20,512 INFO L93 Difference]: Finished difference Result 1671 states and 1997 transitions. [2022-07-23 12:50:20,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:50:20,513 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-23 12:50:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:20,517 INFO L225 Difference]: With dead ends: 1671 [2022-07-23 12:50:20,517 INFO L226 Difference]: Without dead ends: 1671 [2022-07-23 12:50:20,517 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-23 12:50:20,517 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.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:50:20,518 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.0s Time] [2022-07-23 12:50:20,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-07-23 12:50:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1274. [2022-07-23 12:50:20,534 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-23 12:50:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1375 transitions. [2022-07-23 12:50:20,537 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1375 transitions. Word has length 7 [2022-07-23 12:50:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:20,537 INFO L495 AbstractCegarLoop]: Abstraction has 1274 states and 1375 transitions. [2022-07-23 12:50:20,537 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-23 12:50:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1375 transitions. [2022-07-23 12:50:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 12:50:20,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:20,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:50:20,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-23 12:50:20,744 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-23 12:50:20,745 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-23 12:50:20,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:20,746 INFO L85 PathProgramCache]: Analyzing trace with hash -846217710, now seen corresponding path program 1 times [2022-07-23 12:50:20,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:20,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644078421] [2022-07-23 12:50:20,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:20,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:20,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:20,760 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-23 12:50:20,803 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-23 12:50:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:20,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:50:20,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:20,923 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-23 12:50:20,933 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-23 12:50:20,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:20,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:20,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644078421] [2022-07-23 12:50:20,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644078421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:20,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:20,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:50:20,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014096323] [2022-07-23 12:50:20,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:20,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:50:20,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:20,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:50:20,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:50:20,936 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-23 12:50:22,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:22,509 INFO L93 Difference]: Finished difference Result 1601 states and 1729 transitions. [2022-07-23 12:50:22,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:50:22,510 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-23 12:50:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:22,513 INFO L225 Difference]: With dead ends: 1601 [2022-07-23 12:50:22,514 INFO L226 Difference]: Without dead ends: 1601 [2022-07-23 12:50:22,514 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-23 12:50:22,514 INFO L413 NwaCegarLoop]: 1204 mSDtfsCounter, 988 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-07-23 12:50:22,515 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.5s Time] [2022-07-23 12:50:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-07-23 12:50:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1227. [2022-07-23 12:50:22,538 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-23 12:50:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1327 transitions. [2022-07-23 12:50:22,541 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1327 transitions. Word has length 8 [2022-07-23 12:50:22,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:22,541 INFO L495 AbstractCegarLoop]: Abstraction has 1227 states and 1327 transitions. [2022-07-23 12:50:22,541 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-23 12:50:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1327 transitions. [2022-07-23 12:50:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 12:50:22,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:22,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:50:22,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-23 12:50:22,755 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-23 12:50:22,756 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-23 12:50:22,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:22,756 INFO L85 PathProgramCache]: Analyzing trace with hash -846217709, now seen corresponding path program 1 times [2022-07-23 12:50:22,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:22,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599541939] [2022-07-23 12:50:22,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:22,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:22,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:22,758 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-23 12:50:22,761 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-23 12:50:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:22,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:50:22,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:22,869 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-23 12:50:22,882 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-23 12:50:22,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:22,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:22,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599541939] [2022-07-23 12:50:22,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599541939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:22,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:22,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:50:22,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670670291] [2022-07-23 12:50:22,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:22,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:50:22,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:22,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:50:22,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:50:22,885 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-23 12:50:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:24,754 INFO L93 Difference]: Finished difference Result 1694 states and 1828 transitions. [2022-07-23 12:50:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:50:24,755 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-23 12:50:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:24,759 INFO L225 Difference]: With dead ends: 1694 [2022-07-23 12:50:24,759 INFO L226 Difference]: Without dead ends: 1694 [2022-07-23 12:50:24,759 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-23 12:50:24,760 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-23 12:50:24,760 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-23 12:50:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2022-07-23 12:50:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1469. [2022-07-23 12:50:24,774 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-23 12:50:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1825 transitions. [2022-07-23 12:50:24,777 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1825 transitions. Word has length 8 [2022-07-23 12:50:24,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:24,777 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 1825 transitions. [2022-07-23 12:50:24,777 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-23 12:50:24,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1825 transitions. [2022-07-23 12:50:24,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 12:50:24,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:24,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:50:24,785 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-23 12:50:24,984 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-23 12:50:24,984 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-23 12:50:24,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:24,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1255764539, now seen corresponding path program 1 times [2022-07-23 12:50:24,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:24,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576432198] [2022-07-23 12:50:24,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:24,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:24,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:24,987 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-23 12:50:24,989 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-23 12:50:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:25,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:50:25,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:25,136 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-23 12:50:25,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:25,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:25,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576432198] [2022-07-23 12:50:25,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576432198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:25,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:25,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:50:25,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976084397] [2022-07-23 12:50:25,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:25,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:50:25,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:25,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:50:25,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:50:25,141 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-23 12:50:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:25,389 INFO L93 Difference]: Finished difference Result 2286 states and 2860 transitions. [2022-07-23 12:50:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:50:25,390 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-23 12:50:25,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:25,395 INFO L225 Difference]: With dead ends: 2286 [2022-07-23 12:50:25,395 INFO L226 Difference]: Without dead ends: 2286 [2022-07-23 12:50:25,395 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-23 12:50:25,396 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-23 12:50:25,396 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-23 12:50:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2022-07-23 12:50:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 1869. [2022-07-23 12:50:25,416 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-23 12:50:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2605 transitions. [2022-07-23 12:50:25,420 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2605 transitions. Word has length 11 [2022-07-23 12:50:25,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:25,420 INFO L495 AbstractCegarLoop]: Abstraction has 1869 states and 2605 transitions. [2022-07-23 12:50:25,420 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-23 12:50:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2605 transitions. [2022-07-23 12:50:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 12:50:25,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:25,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:50:25,428 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-23 12:50:25,628 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-23 12:50:25,630 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-23 12:50:25,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:25,631 INFO L85 PathProgramCache]: Analyzing trace with hash -680989669, now seen corresponding path program 1 times [2022-07-23 12:50:25,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:25,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241903069] [2022-07-23 12:50:25,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:25,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:25,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:25,634 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-23 12:50:25,634 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-23 12:50:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:25,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 12:50:25,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:25,778 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-23 12:50:25,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:25,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:25,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241903069] [2022-07-23 12:50:25,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241903069] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:25,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:25,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:50:25,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570429720] [2022-07-23 12:50:25,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:25,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:50:25,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:25,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:50:25,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:50:25,780 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-23 12:50:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:25,806 INFO L93 Difference]: Finished difference Result 1992 states and 2665 transitions. [2022-07-23 12:50:25,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:50:25,819 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-23 12:50:25,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:25,825 INFO L225 Difference]: With dead ends: 1992 [2022-07-23 12:50:25,825 INFO L226 Difference]: Without dead ends: 1992 [2022-07-23 12:50:25,825 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-23 12:50:25,826 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-23 12:50:25,826 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-23 12:50:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2022-07-23 12:50:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1773. [2022-07-23 12:50:25,884 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-23 12:50:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2433 transitions. [2022-07-23 12:50:25,889 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2433 transitions. Word has length 13 [2022-07-23 12:50:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:25,890 INFO L495 AbstractCegarLoop]: Abstraction has 1773 states and 2433 transitions. [2022-07-23 12:50:25,890 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-23 12:50:25,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2433 transitions. [2022-07-23 12:50:25,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 12:50:25,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:25,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:50:25,898 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-23 12:50:26,098 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-23 12:50:26,099 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-23 12:50:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1323693751, now seen corresponding path program 1 times [2022-07-23 12:50:26,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:26,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122778084] [2022-07-23 12:50:26,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:26,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:26,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:26,102 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-23 12:50:26,103 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-23 12:50:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:26,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 12:50:26,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:26,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 12:50:26,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 12:50:26,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 12:50:26,300 INFO L356 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2022-07-23 12:50:26,300 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-23 12:50:26,331 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-23 12:50:26,332 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-23 12:50:26,341 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-23 12:50:26,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:26,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:26,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122778084] [2022-07-23 12:50:26,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122778084] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:26,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:26,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:50:26,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003087183] [2022-07-23 12:50:26,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:26,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:50:26,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:26,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:50:26,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:50:26,342 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-23 12:50:27,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:27,244 INFO L93 Difference]: Finished difference Result 2415 states and 3336 transitions. [2022-07-23 12:50:27,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:50:27,245 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-23 12:50:27,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:27,250 INFO L225 Difference]: With dead ends: 2415 [2022-07-23 12:50:27,251 INFO L226 Difference]: Without dead ends: 2415 [2022-07-23 12:50:27,251 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-23 12:50:27,251 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-23 12:50:27,251 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-23 12:50:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2022-07-23 12:50:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 1772. [2022-07-23 12:50:27,270 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-23 12:50:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2431 transitions. [2022-07-23 12:50:27,273 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2431 transitions. Word has length 14 [2022-07-23 12:50:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:27,273 INFO L495 AbstractCegarLoop]: Abstraction has 1772 states and 2431 transitions. [2022-07-23 12:50:27,273 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-23 12:50:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2431 transitions. [2022-07-23 12:50:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 12:50:27,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:27,274 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-23 12:50:27,282 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-23 12:50:27,482 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-23 12:50:27,483 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-23 12:50:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:27,483 INFO L85 PathProgramCache]: Analyzing trace with hash -413650658, now seen corresponding path program 1 times [2022-07-23 12:50:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:27,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239411601] [2022-07-23 12:50:27,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:27,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:27,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:27,485 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-23 12:50:27,487 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-23 12:50:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:27,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 12:50:27,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:27,624 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-23 12:50:27,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:27,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:27,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239411601] [2022-07-23 12:50:27,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239411601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:27,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:27,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:50:27,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494121368] [2022-07-23 12:50:27,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:27,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:50:27,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:27,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:50:27,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:50:27,626 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-23 12:50:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:27,647 INFO L93 Difference]: Finished difference Result 1712 states and 2345 transitions. [2022-07-23 12:50:27,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:50:27,647 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-23 12:50:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:27,651 INFO L225 Difference]: With dead ends: 1712 [2022-07-23 12:50:27,651 INFO L226 Difference]: Without dead ends: 1712 [2022-07-23 12:50:27,651 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-23 12:50:27,652 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-23 12:50:27,652 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-23 12:50:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-07-23 12:50:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1712. [2022-07-23 12:50:27,666 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-23 12:50:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2345 transitions. [2022-07-23 12:50:27,692 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2345 transitions. Word has length 18 [2022-07-23 12:50:27,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:27,692 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 2345 transitions. [2022-07-23 12:50:27,692 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-23 12:50:27,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2345 transitions. [2022-07-23 12:50:27,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 12:50:27,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:27,693 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-23 12:50:27,711 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-23 12:50:27,901 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-23 12:50:27,901 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-23 12:50:27,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:27,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1913675577, now seen corresponding path program 1 times [2022-07-23 12:50:27,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:27,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245396771] [2022-07-23 12:50:27,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:27,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:27,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:27,904 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-23 12:50:27,908 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-23 12:50:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:28,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:50:28,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:28,072 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-23 12:50:28,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:28,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:28,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245396771] [2022-07-23 12:50:28,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245396771] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:28,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:28,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:50:28,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013027345] [2022-07-23 12:50:28,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:28,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:50:28,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:28,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:50:28,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:50:28,074 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-23 12:50:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:28,131 INFO L93 Difference]: Finished difference Result 1684 states and 2289 transitions. [2022-07-23 12:50:28,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:50:28,132 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-23 12:50:28,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:28,138 INFO L225 Difference]: With dead ends: 1684 [2022-07-23 12:50:28,138 INFO L226 Difference]: Without dead ends: 1684 [2022-07-23 12:50:28,138 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-23 12:50:28,139 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-23 12:50:28,139 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-23 12:50:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-07-23 12:50:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1682. [2022-07-23 12:50:28,161 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-23 12:50:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2287 transitions. [2022-07-23 12:50:28,164 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2287 transitions. Word has length 20 [2022-07-23 12:50:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:28,165 INFO L495 AbstractCegarLoop]: Abstraction has 1682 states and 2287 transitions. [2022-07-23 12:50:28,165 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-23 12:50:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2287 transitions. [2022-07-23 12:50:28,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 12:50:28,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:28,166 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-23 12:50:28,179 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-23 12:50:28,376 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-23 12:50:28,377 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-23 12:50:28,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:28,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753126, now seen corresponding path program 1 times [2022-07-23 12:50:28,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:28,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280251265] [2022-07-23 12:50:28,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:28,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:28,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:28,379 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-23 12:50:28,380 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-23 12:50:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:28,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:50:28,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:28,547 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-23 12:50:28,608 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-23 12:50:28,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:28,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:28,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280251265] [2022-07-23 12:50:28,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280251265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:28,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:28,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:50:28,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866550224] [2022-07-23 12:50:28,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:28,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:50:28,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:28,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:50:28,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:50:28,609 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-23 12:50:30,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:30,400 INFO L93 Difference]: Finished difference Result 2541 states and 3552 transitions. [2022-07-23 12:50:30,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 12:50:30,401 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-23 12:50:30,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:30,407 INFO L225 Difference]: With dead ends: 2541 [2022-07-23 12:50:30,408 INFO L226 Difference]: Without dead ends: 2541 [2022-07-23 12:50:30,408 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-23 12:50:30,408 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 2164 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2022-07-23 12:50:30,408 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.7s Time] [2022-07-23 12:50:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2022-07-23 12:50:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 1678. [2022-07-23 12:50:30,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-23 12:50:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2279 transitions. [2022-07-23 12:50:30,429 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2279 transitions. Word has length 34 [2022-07-23 12:50:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:30,429 INFO L495 AbstractCegarLoop]: Abstraction has 1678 states and 2279 transitions. [2022-07-23 12:50:30,429 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-23 12:50:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2279 transitions. [2022-07-23 12:50:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 12:50:30,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:30,430 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-23 12:50:30,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-23 12:50:30,656 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-23 12:50:30,657 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-23 12:50:30,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:30,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753127, now seen corresponding path program 1 times [2022-07-23 12:50:30,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:30,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677531687] [2022-07-23 12:50:30,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:30,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:30,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:30,659 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-23 12:50:30,661 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-23 12:50:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:30,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 12:50:30,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:30,816 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-23 12:50:30,912 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-23 12:50:30,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:30,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:30,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677531687] [2022-07-23 12:50:30,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677531687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:30,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:30,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:50:30,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704583202] [2022-07-23 12:50:30,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:30,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:50:30,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:30,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:50:30,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:50:30,915 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-23 12:50:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:33,790 INFO L93 Difference]: Finished difference Result 2089 states and 2498 transitions. [2022-07-23 12:50:33,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 12:50:33,792 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-23 12:50:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:33,796 INFO L225 Difference]: With dead ends: 2089 [2022-07-23 12:50:33,797 INFO L226 Difference]: Without dead ends: 2089 [2022-07-23 12:50:33,797 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-23 12:50:33,797 INFO L413 NwaCegarLoop]: 1521 mSDtfsCounter, 1298 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.8s IncrementalHoareTripleChecker+Time [2022-07-23 12:50:33,797 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.8s Time] [2022-07-23 12:50:33,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2022-07-23 12:50:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1674. [2022-07-23 12:50:33,814 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-23 12:50:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2271 transitions. [2022-07-23 12:50:33,816 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2271 transitions. Word has length 34 [2022-07-23 12:50:33,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:33,817 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 2271 transitions. [2022-07-23 12:50:33,817 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-23 12:50:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2271 transitions. [2022-07-23 12:50:33,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 12:50:33,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:33,818 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-23 12:50:33,843 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-23 12:50:34,026 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-23 12:50:34,026 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-23 12:50:34,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:34,027 INFO L85 PathProgramCache]: Analyzing trace with hash -515146363, now seen corresponding path program 1 times [2022-07-23 12:50:34,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:34,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80351124] [2022-07-23 12:50:34,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:34,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:34,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:34,045 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-23 12:50:34,081 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-23 12:50:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:34,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:50:34,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:34,268 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-23 12:50:34,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:34,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:34,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80351124] [2022-07-23 12:50:34,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80351124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:34,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:34,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:50:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30808819] [2022-07-23 12:50:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:34,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:50:34,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:34,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:50:34,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:50:34,271 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-23 12:50:34,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:34,315 INFO L93 Difference]: Finished difference Result 1662 states and 2251 transitions. [2022-07-23 12:50:34,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:50:34,316 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-23 12:50:34,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:34,320 INFO L225 Difference]: With dead ends: 1662 [2022-07-23 12:50:34,320 INFO L226 Difference]: Without dead ends: 1662 [2022-07-23 12:50:34,320 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-23 12:50:34,321 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-23 12:50:34,321 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-23 12:50:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2022-07-23 12:50:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1662. [2022-07-23 12:50:34,338 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-23 12:50:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2251 transitions. [2022-07-23 12:50:34,340 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2251 transitions. Word has length 52 [2022-07-23 12:50:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:34,340 INFO L495 AbstractCegarLoop]: Abstraction has 1662 states and 2251 transitions. [2022-07-23 12:50:34,340 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-23 12:50:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2251 transitions. [2022-07-23 12:50:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-23 12:50:34,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:34,341 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-23 12:50:34,351 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-23 12:50:34,551 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-23 12:50:34,551 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-23 12:50:34,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:34,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1189287633, now seen corresponding path program 1 times [2022-07-23 12:50:34,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:34,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803672445] [2022-07-23 12:50:34,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:34,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:34,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:34,566 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-23 12:50:34,567 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-23 12:50:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:34,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 12:50:34,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:34,879 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-23 12:50:34,884 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-23 12:50:35,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 12:50:35,175 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-23 12:50:35,183 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:50:35,183 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-23 12:50:35,193 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-23 12:50:35,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:35,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:35,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803672445] [2022-07-23 12:50:35,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803672445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:35,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:35,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:50:35,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986983084] [2022-07-23 12:50:35,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:35,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:50:35,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:35,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:50:35,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:50:35,196 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-23 12:50:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:36,933 INFO L93 Difference]: Finished difference Result 1633 states and 2223 transitions. [2022-07-23 12:50:36,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:50:36,934 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-23 12:50:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:36,938 INFO L225 Difference]: With dead ends: 1633 [2022-07-23 12:50:36,938 INFO L226 Difference]: Without dead ends: 1633 [2022-07-23 12:50:36,938 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-23 12:50:36,938 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 833 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2022-07-23 12:50:36,939 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.7s Time] [2022-07-23 12:50:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-07-23 12:50:36,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1250. [2022-07-23 12:50:36,954 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-23 12:50:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1471 transitions. [2022-07-23 12:50:36,956 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1471 transitions. Word has length 60 [2022-07-23 12:50:36,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:36,956 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1471 transitions. [2022-07-23 12:50:36,956 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-23 12:50:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1471 transitions. [2022-07-23 12:50:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-23 12:50:36,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:36,957 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-23 12:50:36,979 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-23 12:50:37,168 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-23 12:50:37,168 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-23 12:50:37,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:37,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054235, now seen corresponding path program 1 times [2022-07-23 12:50:37,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:37,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747526684] [2022-07-23 12:50:37,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:37,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:37,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:37,171 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-23 12:50:37,172 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-23 12:50:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:37,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 12:50:37,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:37,425 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-23 12:50:37,433 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-23 12:50:37,450 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-23 12:50:37,457 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-23 12:50:37,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:37,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:37,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747526684] [2022-07-23 12:50:37,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747526684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:37,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:37,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:50:37,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720817753] [2022-07-23 12:50:37,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:37,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 12:50:37,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:37,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 12:50:37,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:50:37,460 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-23 12:50:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:39,255 INFO L93 Difference]: Finished difference Result 1249 states and 1470 transitions. [2022-07-23 12:50:39,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 12:50:39,256 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-23 12:50:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:39,259 INFO L225 Difference]: With dead ends: 1249 [2022-07-23 12:50:39,259 INFO L226 Difference]: Without dead ends: 1249 [2022-07-23 12:50:39,259 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-23 12:50:39,259 INFO L413 NwaCegarLoop]: 1126 mSDtfsCounter, 4 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2022-07-23 12:50:39,260 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.8s Time] [2022-07-23 12:50:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2022-07-23 12:50:39,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2022-07-23 12:50:39,272 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-23 12:50:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1470 transitions. [2022-07-23 12:50:39,273 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1470 transitions. Word has length 65 [2022-07-23 12:50:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:39,274 INFO L495 AbstractCegarLoop]: Abstraction has 1249 states and 1470 transitions. [2022-07-23 12:50:39,274 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-23 12:50:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1470 transitions. [2022-07-23 12:50:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-23 12:50:39,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:39,276 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-23 12:50:39,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-23 12:50:39,486 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-23 12:50:39,486 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-23 12:50:39,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:39,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054234, now seen corresponding path program 1 times [2022-07-23 12:50:39,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:39,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404816359] [2022-07-23 12:50:39,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:39,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:39,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:39,490 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-23 12:50:39,492 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-23 12:50:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:39,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 12:50:39,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:39,742 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-23 12:50:39,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-23 12:50:39,770 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-23 12:50:39,817 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-23 12:50:39,820 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-23 12:50:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:50:39,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:39,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:39,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404816359] [2022-07-23 12:50:39,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404816359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:39,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:39,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:50:39,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994303168] [2022-07-23 12:50:39,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:39,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 12:50:39,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:39,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 12:50:39,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:50:39,834 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-23 12:50:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:42,408 INFO L93 Difference]: Finished difference Result 1248 states and 1469 transitions. [2022-07-23 12:50:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 12:50:42,410 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-23 12:50:42,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:42,412 INFO L225 Difference]: With dead ends: 1248 [2022-07-23 12:50:42,412 INFO L226 Difference]: Without dead ends: 1248 [2022-07-23 12:50:42,412 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-23 12:50:42,413 INFO L413 NwaCegarLoop]: 1126 mSDtfsCounter, 2 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.5s IncrementalHoareTripleChecker+Time [2022-07-23 12:50:42,413 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.5s Time] [2022-07-23 12:50:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-07-23 12:50:42,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1248. [2022-07-23 12:50:42,422 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-23 12:50:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1469 transitions. [2022-07-23 12:50:42,439 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1469 transitions. Word has length 65 [2022-07-23 12:50:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:42,439 INFO L495 AbstractCegarLoop]: Abstraction has 1248 states and 1469 transitions. [2022-07-23 12:50:42,439 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-23 12:50:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1469 transitions. [2022-07-23 12:50:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-23 12:50:42,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:42,440 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-23 12:50:42,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-23 12:50:42,650 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-23 12:50:42,650 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-23 12:50:42,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:42,651 INFO L85 PathProgramCache]: Analyzing trace with hash 827014060, now seen corresponding path program 1 times [2022-07-23 12:50:42,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:42,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594028271] [2022-07-23 12:50:42,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:42,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:42,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:42,653 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-23 12:50:42,662 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-23 12:50:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:42,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:50:42,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:42,930 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-23 12:50:42,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:50:42,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:42,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594028271] [2022-07-23 12:50:42,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594028271] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:50:42,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:50:42,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:50:42,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399708154] [2022-07-23 12:50:42,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:50:42,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:50:42,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:42,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:50:42,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:50:42,933 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-23 12:50:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:42,967 INFO L93 Difference]: Finished difference Result 1251 states and 1473 transitions. [2022-07-23 12:50:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:50:42,968 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-23 12:50:42,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:42,971 INFO L225 Difference]: With dead ends: 1251 [2022-07-23 12:50:42,971 INFO L226 Difference]: Without dead ends: 1251 [2022-07-23 12:50:42,971 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-23 12:50:42,972 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-23 12:50:42,972 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-23 12:50:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2022-07-23 12:50:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2022-07-23 12:50:42,984 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-23 12:50:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1473 transitions. [2022-07-23 12:50:42,986 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1473 transitions. Word has length 73 [2022-07-23 12:50:42,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:42,986 INFO L495 AbstractCegarLoop]: Abstraction has 1251 states and 1473 transitions. [2022-07-23 12:50:42,986 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-23 12:50:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1473 transitions. [2022-07-23 12:50:42,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-23 12:50:42,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:50:42,999 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-23 12:50:43,196 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-23 12:50:43,197 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-23 12:50:43,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash 505961995, now seen corresponding path program 1 times [2022-07-23 12:50:43,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:43,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4655103] [2022-07-23 12:50:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:50:43,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:43,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:43,200 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-23 12:50:43,204 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-23 12:50:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:50:43,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:50:43,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:43,465 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-23 12:50:43,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:50:43,534 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-23 12:50:43,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:43,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4655103] [2022-07-23 12:50:43,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4655103] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:50:43,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:50:43,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-23 12:50:43,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360932484] [2022-07-23 12:50:43,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:50:43,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 12:50:43,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:43,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 12:50:43,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 12:50:43,536 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-23 12:50:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:43,658 INFO L93 Difference]: Finished difference Result 1263 states and 1490 transitions. [2022-07-23 12:50:43,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 12:50:43,659 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-23 12:50:43,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:43,661 INFO L225 Difference]: With dead ends: 1263 [2022-07-23 12:50:43,661 INFO L226 Difference]: Without dead ends: 1263 [2022-07-23 12:50:43,662 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-23 12:50:43,662 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-23 12:50:43,662 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-23 12:50:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2022-07-23 12:50:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1261. [2022-07-23 12:50:43,675 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-23 12:50:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1488 transitions. [2022-07-23 12:50:43,677 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1488 transitions. Word has length 74 [2022-07-23 12:50:43,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:43,677 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1488 transitions. [2022-07-23 12:50:43,677 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-23 12:50:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1488 transitions. [2022-07-23 12:50:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-23 12:50:43,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:43,678 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-23 12:50:43,688 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-23 12:50:43,888 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-23 12:50:43,888 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-23 12:50:43,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:43,889 INFO L85 PathProgramCache]: Analyzing trace with hash 279993196, now seen corresponding path program 2 times [2022-07-23 12:50:43,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:43,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686329575] [2022-07-23 12:50:43,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 12:50:43,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:43,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:43,893 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-23 12:50:43,896 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-23 12:50:44,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 12:50:44,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:50:44,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 12:50:44,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:44,421 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-23 12:50:44,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:50:44,549 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-23 12:50:44,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:44,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686329575] [2022-07-23 12:50:44,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686329575] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:50:44,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:50:44,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-23 12:50:44,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136750788] [2022-07-23 12:50:44,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:50:44,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 12:50:44,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:44,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 12:50:44,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 12:50:44,552 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-23 12:50:45,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:45,024 INFO L93 Difference]: Finished difference Result 1282 states and 1516 transitions. [2022-07-23 12:50:45,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 12:50:45,025 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-23 12:50:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:45,027 INFO L225 Difference]: With dead ends: 1282 [2022-07-23 12:50:45,027 INFO L226 Difference]: Without dead ends: 1278 [2022-07-23 12:50:45,027 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-23 12:50:45,028 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-23 12:50:45,028 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-23 12:50:45,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2022-07-23 12:50:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1270. [2022-07-23 12:50:45,068 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-23 12:50:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1500 transitions. [2022-07-23 12:50:45,070 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1500 transitions. Word has length 77 [2022-07-23 12:50:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:45,070 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1500 transitions. [2022-07-23 12:50:45,070 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-23 12:50:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1500 transitions. [2022-07-23 12:50:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 12:50:45,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:45,071 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-23 12:50:45,082 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-23 12:50:45,271 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-23 12:50:45,272 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-23 12:50:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:45,272 INFO L85 PathProgramCache]: Analyzing trace with hash -183892212, now seen corresponding path program 3 times [2022-07-23 12:50:45,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:45,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169930695] [2022-07-23 12:50:45,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 12:50:45,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:45,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:45,274 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-23 12:50:45,276 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-23 12:50:45,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-23 12:50:45,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:50:45,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 12:50:45,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:46,115 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-23 12:50:46,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:50:46,619 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-23 12:50:46,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:46,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169930695] [2022-07-23 12:50:46,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169930695] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:50:46,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:50:46,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-23 12:50:46,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436476539] [2022-07-23 12:50:46,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:50:46,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 12:50:46,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:46,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 12:50:46,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-23 12:50:46,620 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-23 12:50:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:50:49,180 INFO L93 Difference]: Finished difference Result 1312 states and 1562 transitions. [2022-07-23 12:50:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-23 12:50:49,181 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-23 12:50:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:50:49,183 INFO L225 Difference]: With dead ends: 1312 [2022-07-23 12:50:49,183 INFO L226 Difference]: Without dead ends: 1306 [2022-07-23 12:50:49,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-23 12:50:49,185 INFO L413 NwaCegarLoop]: 1135 mSDtfsCounter, 181 mSDsluCounter, 13562 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-23 12:50:49,185 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.7s Time] [2022-07-23 12:50:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2022-07-23 12:50:49,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1288. [2022-07-23 12:50:49,201 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-23 12:50:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1523 transitions. [2022-07-23 12:50:49,202 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1523 transitions. Word has length 83 [2022-07-23 12:50:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:50:49,203 INFO L495 AbstractCegarLoop]: Abstraction has 1288 states and 1523 transitions. [2022-07-23 12:50:49,203 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-23 12:50:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1523 transitions. [2022-07-23 12:50:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-23 12:50:49,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:50:49,204 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-23 12:50:49,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-23 12:50:49,415 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-23 12:50:49,415 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-23 12:50:49,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:50:49,416 INFO L85 PathProgramCache]: Analyzing trace with hash 171030092, now seen corresponding path program 4 times [2022-07-23 12:50:49,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:50:49,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517159996] [2022-07-23 12:50:49,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 12:50:49,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:50:49,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:50:49,418 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-23 12:50:49,420 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-23 12:50:49,727 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 12:50:49,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:50:49,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 12:50:49,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:50:50,049 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-23 12:50:50,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:50:51,375 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-23 12:50:51,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:50:51,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517159996] [2022-07-23 12:50:51,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517159996] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:50:51,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:50:51,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-23 12:50:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242124880] [2022-07-23 12:50:51,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:50:51,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 12:50:51,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:50:51,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 12:50:51,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-23 12:50:51,377 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-23 12:51:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:51:00,459 INFO L93 Difference]: Finished difference Result 1368 states and 1635 transitions. [2022-07-23 12:51:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-23 12:51:00,460 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-23 12:51:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:51:00,462 INFO L225 Difference]: With dead ends: 1368 [2022-07-23 12:51:00,462 INFO L226 Difference]: Without dead ends: 1364 [2022-07-23 12:51:00,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-23 12:51:00,466 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:51:00,466 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.1s Time] [2022-07-23 12:51:00,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-07-23 12:51:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1322. [2022-07-23 12:51:00,480 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-23 12:51:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1569 transitions. [2022-07-23 12:51:00,481 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1569 transitions. Word has length 95 [2022-07-23 12:51:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:51:00,481 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 1569 transitions. [2022-07-23 12:51:00,481 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-23 12:51:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1569 transitions. [2022-07-23 12:51:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-23 12:51:00,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:51:00,482 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-23 12:51:00,498 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-23 12:51:00,693 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-23 12:51:00,694 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-23 12:51:00,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:51:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1801422612, now seen corresponding path program 5 times [2022-07-23 12:51:00,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:51:00,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976208766] [2022-07-23 12:51:00,695 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 12:51:00,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:51:00,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:51:00,697 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-23 12:51:00,714 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-23 12:51:01,983 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 12:51:01,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:51:02,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-23 12:51:02,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:51:02,036 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-23 12:51:02,108 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 12:51:02,109 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-23 12:51:02,126 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-23 12:51:02,199 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-23 12:51:02,716 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-23 12:51:03,275 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:51:03,275 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-23 12:51:03,296 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-23 12:51:03,327 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-23 12:51:03,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:51:03,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:51:03,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976208766] [2022-07-23 12:51:03,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976208766] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:51:03,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1885613894] [2022-07-23 12:51:03,555 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 12:51:03,555 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 12:51:03,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 12:51:03,557 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-23 12:51:03,574 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-23 12:52:35,990 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 12:52:35,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:52:36,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-23 12:52:36,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:52:36,258 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-23 12:52:36,329 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 12:52:36,329 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-23 12:52:36,338 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-23 12:52:36,369 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-23 12:52:36,668 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_2382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2382)))) is different from true [2022-07-23 12:52:36,678 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_2383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2383)))) is different from true [2022-07-23 12:52:37,340 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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-07-23 12:52:37,477 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:52:37,477 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-23 12:52:37,495 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-23 12:52:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-07-23 12:52:37,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:52:37,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1885613894] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:52:37,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:52:37,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 12 [2022-07-23 12:52:37,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745999394] [2022-07-23 12:52:37,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:52:37,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 12:52:37,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:52:37,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 12:52:37,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=98, Unknown=13, NotChecked=92, Total=240 [2022-07-23 12:52:37,685 INFO L87 Difference]: Start difference. First operand 1322 states and 1569 transitions. Second operand has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 13 states have internal predecessors, (80), 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-23 12:52:37,923 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_2382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2382))) (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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-07-23 12:52:37,930 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_2382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2382))) (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_2383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2383))) (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_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-07-23 12:52:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:52:40,061 INFO L93 Difference]: Finished difference Result 1332 states and 1577 transitions. [2022-07-23 12:52:40,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 12:52:40,063 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 13 states have internal predecessors, (80), 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-23 12:52:40,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:52:40,064 INFO L225 Difference]: With dead ends: 1332 [2022-07-23 12:52:40,064 INFO L226 Difference]: Without dead ends: 1328 [2022-07-23 12:52:40,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 139 SyntacticMatches, 87 SemanticMatches, 18 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=54, Invalid=135, Unknown=17, NotChecked=174, Total=380 [2022-07-23 12:52:40,065 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 759 mSDsluCounter, 2891 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 3631 SdHoareTripleChecker+Invalid, 8552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6685 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:52:40,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 3631 Invalid, 8552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1859 Invalid, 0 Unknown, 6685 Unchecked, 2.2s Time] [2022-07-23 12:52:40,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-07-23 12:52:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1321. [2022-07-23 12:52:40,092 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-23 12:52:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1564 transitions. [2022-07-23 12:52:40,094 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1564 transitions. Word has length 117 [2022-07-23 12:52:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:52:40,094 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1564 transitions. [2022-07-23 12:52:40,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 13 states have internal predecessors, (80), 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-23 12:52:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1564 transitions. [2022-07-23 12:52:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-23 12:52:40,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:52:40,097 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-23 12:52:40,132 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-23 12:52:40,312 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-23 12:52:40,497 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-23 12:52:40,498 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-23 12:52:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:52:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1801422611, now seen corresponding path program 1 times [2022-07-23 12:52:40,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:52:40,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261232828] [2022-07-23 12:52:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:52:40,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:52:40,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:52:40,501 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-23 12:52:40,502 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-23 12:52:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:52:41,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-23 12:52:41,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:52:41,313 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-23 12:52:41,378 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-23 12:52:41,386 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:52:41,386 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-23 12:52:41,400 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-23 12:52:41,406 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-23 12:52:41,468 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-23 12:52:41,471 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-23 12:52:41,507 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2837) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2836)))) is different from true [2022-07-23 12:52:41,603 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2844))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2845)))) is different from true [2022-07-23 12:52:41,610 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2847 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2847) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2846) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:52:41,618 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-23 12:52:41,626 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-23 12:52:41,633 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-23 12:52:41,641 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_2855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2855))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854)))) is different from true [2022-07-23 12:52:41,648 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-23 12:52:41,655 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-23 12:52:41,737 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2869))) (exists ((v_ArrVal_2868 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2868) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-23 12:52:41,744 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-23 12:52:41,752 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-23 12:52:41,759 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_2875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2875))) (exists ((v_ArrVal_2874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2874)))) is different from true [2022-07-23 12:52:41,766 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2877))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2876)))) is different from true [2022-07-23 12:52:41,774 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-23 12:52:41,781 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-23 12:52:41,807 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2884))) (exists ((v_ArrVal_2885 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2885))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-23 12:52:41,814 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-23 12:52:41,859 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2892) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2893) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:52:41,867 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-23 12:52:41,874 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-23 12:52:41,881 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-23 12:52:41,888 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2901 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2901))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2900) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:52:41,896 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-23 12:52:41,903 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_2905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2905))) (exists ((v_ArrVal_2904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2904)))) is different from true [2022-07-23 12:52:41,910 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_2906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2906))) (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:52:41,936 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2911))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2910)))) is different from true [2022-07-23 12:52:41,961 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-23 12:52:41,969 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-23 12:52:41,976 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-23 12:52:41,983 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-23 12:52:41,990 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_2922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2922))) (exists ((v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2923) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:52:42,028 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:52:42,028 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-23 12:52:42,032 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-23 12:52:42,072 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-23 12:52:42,075 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-23 12:52:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 912 not checked. [2022-07-23 12:52:42,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:52:42,872 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-23 12:52:42,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:52:42,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261232828] [2022-07-23 12:52:42,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261232828] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:52:42,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [851790736] [2022-07-23 12:52:42,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:52:42,884 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 12:52:42,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 12:52:42,885 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-23 12:52:42,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process