./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-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/ldv-memsafety/memleaks_test22_3-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 14e3e63e231fa0c862b0912d52fb4325a0198eb4d9a43387e9996f85700980cb --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:13:34,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:13:34,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:13:34,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:13:34,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:13:34,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:13:34,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:13:34,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:13:34,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:13:34,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:13:34,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:13:34,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:13:34,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:13:34,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:13:34,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:13:34,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:13:34,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:13:34,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:13:34,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:13:34,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:13:34,083 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:13:34,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:13:34,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:13:34,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:13:34,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:13:34,092 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:13:34,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:13:34,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:13:34,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:13:34,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:13:34,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:13:34,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:13:34,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:13:34,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:13:34,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:13:34,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:13:34,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:13:34,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:13:34,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:13:34,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:13:34,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:13:34,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:13:34,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:13:34,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:13:34,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:13:34,137 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:13:34,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:13:34,137 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:13:34,138 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:13:34,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:13:34,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:13:34,139 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:13:34,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:13:34,140 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:13:34,140 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:13:34,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:13:34,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:13:34,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:13:34,140 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:13:34,141 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:13:34,141 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:13:34,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:13:34,142 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:13:34,142 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:13:34,142 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:13:34,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:13:34,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:13:34,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:13:34,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:13:34,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:13:34,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:13:34,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:13:34,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:13:34,144 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 -> 14e3e63e231fa0c862b0912d52fb4325a0198eb4d9a43387e9996f85700980cb [2022-07-23 06:13:34,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:13:34,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:13:34,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:13:34,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:13:34,388 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:13:34,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2022-07-23 06:13:34,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58bf67df8/b19e3281e94e4582908c745bd88453aa/FLAG30848a71f [2022-07-23 06:13:34,893 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:13:34,893 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2022-07-23 06:13:34,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58bf67df8/b19e3281e94e4582908c745bd88453aa/FLAG30848a71f [2022-07-23 06:13:34,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58bf67df8/b19e3281e94e4582908c745bd88453aa [2022-07-23 06:13:34,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:13:34,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:13:34,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:13:34,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:13:34,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:13:34,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:13:34" (1/1) ... [2022-07-23 06:13:34,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725ad51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:34, skipping insertion in model container [2022-07-23 06:13:34,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:13:34" (1/1) ... [2022-07-23 06:13:34,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:13:34,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:13:35,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:13:35,319 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 06:13:35,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@746fc6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:35, skipping insertion in model container [2022-07-23 06:13:35,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:13:35,320 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 06:13:35,322 INFO L158 Benchmark]: Toolchain (without parser) took 402.98ms. Allocated memory is still 90.2MB. Free memory was 55.5MB in the beginning and 62.1MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 06:13:35,323 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 69.2MB. Free memory was 32.9MB in the beginning and 32.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:13:35,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.52ms. Allocated memory is still 90.2MB. Free memory was 55.4MB in the beginning and 62.1MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 06:13:35,326 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.17ms. Allocated memory is still 69.2MB. Free memory was 32.9MB in the beginning and 32.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.52ms. Allocated memory is still 90.2MB. Free memory was 55.4MB in the beginning and 62.1MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: 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/ldv-memsafety/memleaks_test22_3-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 14e3e63e231fa0c862b0912d52fb4325a0198eb4d9a43387e9996f85700980cb --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:13:37,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:13:37,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:13:37,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:13:37,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:13:37,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:13:37,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:13:37,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:13:37,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:13:37,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:13:37,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:13:37,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:13:37,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:13:37,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:13:37,148 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:13:37,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:13:37,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:13:37,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:13:37,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:13:37,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:13:37,160 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:13:37,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:13:37,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:13:37,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:13:37,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:13:37,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:13:37,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:13:37,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:13:37,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:13:37,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:13:37,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:13:37,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:13:37,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:13:37,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:13:37,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:13:37,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:13:37,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:13:37,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:13:37,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:13:37,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:13:37,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:13:37,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:13:37,182 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 06:13:37,218 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:13:37,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:13:37,219 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:13:37,219 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:13:37,220 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:13:37,220 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:13:37,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:13:37,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:13:37,221 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:13:37,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:13:37,222 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:13:37,222 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:13:37,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:13:37,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:13:37,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:13:37,223 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:13:37,223 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:13:37,223 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:13:37,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:13:37,224 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:13:37,224 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 06:13:37,224 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 06:13:37,224 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:13:37,225 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:13:37,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:13:37,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:13:37,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:13:37,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:13:37,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:13:37,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:13:37,226 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 06:13:37,226 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 06:13:37,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 06:13:37,227 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 -> 14e3e63e231fa0c862b0912d52fb4325a0198eb4d9a43387e9996f85700980cb [2022-07-23 06:13:37,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:13:37,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:13:37,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:13:37,545 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:13:37,546 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:13:37,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2022-07-23 06:13:37,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02eca3cba/5454613d5587426599c4e3df0adf9c79/FLAGa09291d28 [2022-07-23 06:13:38,078 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:13:38,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2022-07-23 06:13:38,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02eca3cba/5454613d5587426599c4e3df0adf9c79/FLAGa09291d28 [2022-07-23 06:13:38,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02eca3cba/5454613d5587426599c4e3df0adf9c79 [2022-07-23 06:13:38,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:13:38,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:13:38,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:13:38,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:13:38,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:13:38,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:13:38" (1/1) ... [2022-07-23 06:13:38,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68026445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:38, skipping insertion in model container [2022-07-23 06:13:38,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:13:38" (1/1) ... [2022-07-23 06:13:38,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:13:38,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:13:38,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:13:38,860 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 06:13:38,870 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:13:38,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:13:38,948 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:13:38,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:13:39,036 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:13:39,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:39 WrapperNode [2022-07-23 06:13:39,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:13:39,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:13:39,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:13:39,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:13:39,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:39" (1/1) ... [2022-07-23 06:13:39,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:39" (1/1) ... [2022-07-23 06:13:39,118 INFO L137 Inliner]: procedures = 165, calls = 70, calls flagged for inlining = 22, calls inlined = 14, statements flattened = 100 [2022-07-23 06:13:39,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:13:39,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:13:39,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:13:39,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:13:39,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:39" (1/1) ... [2022-07-23 06:13:39,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:39" (1/1) ... [2022-07-23 06:13:39,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:39" (1/1) ... [2022-07-23 06:13:39,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:39" (1/1) ... [2022-07-23 06:13:39,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:39" (1/1) ... [2022-07-23 06:13:39,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:39" (1/1) ... [2022-07-23 06:13:39,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:39" (1/1) ... [2022-07-23 06:13:39,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:13:39,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:13:39,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:13:39,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:13:39,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:39" (1/1) ... [2022-07-23 06:13:39,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:13:39,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:13:39,218 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 06:13:39,224 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 06:13:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 06:13:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-07-23 06:13:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-07-23 06:13:39,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 06:13:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 06:13:39,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-07-23 06:13:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-07-23 06:13:39,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:13:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:13:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:13:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:13:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 06:13:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:13:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 06:13:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:13:39,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:13:39,355 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:13:39,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:13:39,635 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:13:39,642 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:13:39,642 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 06:13:39,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:13:39 BoogieIcfgContainer [2022-07-23 06:13:39,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:13:39,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:13:39,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:13:39,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:13:39,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:13:38" (1/3) ... [2022-07-23 06:13:39,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd380a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:13:39, skipping insertion in model container [2022-07-23 06:13:39,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:39" (2/3) ... [2022-07-23 06:13:39,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd380a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:13:39, skipping insertion in model container [2022-07-23 06:13:39,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:13:39" (3/3) ... [2022-07-23 06:13:39,652 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-2.i [2022-07-23 06:13:39,664 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:13:39,666 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-07-23 06:13:39,719 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:13:39,733 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@3ad8ce4a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@271db0bc [2022-07-23 06:13:39,734 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-07-23 06:13:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 70 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:13:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:13:39,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:39,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:39,758 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:39,764 INFO L85 PathProgramCache]: Analyzing trace with hash 265003773, now seen corresponding path program 1 times [2022-07-23 06:13:39,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:39,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825907509] [2022-07-23 06:13:39,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:39,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:39,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:39,783 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 06:13:39,825 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 06:13:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:39,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:13:39,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:39,958 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 06:13:40,010 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 06:13:40,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:40,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:40,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825907509] [2022-07-23 06:13:40,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825907509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:40,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:40,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:13:40,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520210220] [2022-07-23 06:13:40,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:40,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:13:40,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:40,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:13:40,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:13:40,048 INFO L87 Difference]: Start difference. First operand has 77 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 70 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 06:13:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:40,411 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-07-23 06:13:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:13:40,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2022-07-23 06:13:40,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:40,427 INFO L225 Difference]: With dead ends: 101 [2022-07-23 06:13:40,428 INFO L226 Difference]: Without dead ends: 99 [2022-07-23 06:13:40,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:13:40,438 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 52 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:40,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 283 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:13:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-23 06:13:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2022-07-23 06:13:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 72 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:13:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-07-23 06:13:40,481 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 10 [2022-07-23 06:13:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:40,482 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-07-23 06:13:40,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 06:13:40,482 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-07-23 06:13:40,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:13:40,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:40,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:40,492 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 06:13:40,692 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 06:13:40,692 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:40,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:40,693 INFO L85 PathProgramCache]: Analyzing trace with hash 293632924, now seen corresponding path program 1 times [2022-07-23 06:13:40,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:40,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609208707] [2022-07-23 06:13:40,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:40,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:40,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:40,695 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 06:13:40,698 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 06:13:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:40,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:13:40,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:40,809 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 06:13:40,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:40,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:40,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609208707] [2022-07-23 06:13:40,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609208707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:40,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:40,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:13:40,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654223539] [2022-07-23 06:13:40,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:40,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:13:40,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:40,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:13:40,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:13:40,813 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 06:13:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:40,836 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-07-23 06:13:40,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:13:40,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2022-07-23 06:13:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:40,838 INFO L225 Difference]: With dead ends: 84 [2022-07-23 06:13:40,838 INFO L226 Difference]: Without dead ends: 84 [2022-07-23 06:13:40,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:13:40,839 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:40,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 329 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:13:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-23 06:13:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2022-07-23 06:13:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:13:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2022-07-23 06:13:40,847 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 10 [2022-07-23 06:13:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:40,848 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2022-07-23 06:13:40,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 06:13:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2022-07-23 06:13:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 06:13:40,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:40,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:40,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-23 06:13:41,058 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 06:13:41,059 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash -374817580, now seen corresponding path program 1 times [2022-07-23 06:13:41,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:41,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505043098] [2022-07-23 06:13:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:41,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:41,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:41,062 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 06:13:41,070 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 06:13:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:41,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 06:13:41,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:41,159 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 06:13:41,293 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 06:13:41,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:41,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:41,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505043098] [2022-07-23 06:13:41,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505043098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:41,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:41,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:13:41,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486078700] [2022-07-23 06:13:41,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:41,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:13:41,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:41,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:13:41,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:13:41,299 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 06:13:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:41,581 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-07-23 06:13:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:13:41,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 11 [2022-07-23 06:13:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:41,584 INFO L225 Difference]: With dead ends: 89 [2022-07-23 06:13:41,584 INFO L226 Difference]: Without dead ends: 89 [2022-07-23 06:13:41,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:13:41,586 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:41,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 365 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:13:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-23 06:13:41,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2022-07-23 06:13:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:13:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2022-07-23 06:13:41,594 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 11 [2022-07-23 06:13:41,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:41,594 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2022-07-23 06:13:41,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 06:13:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2022-07-23 06:13:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 06:13:41,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:41,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:41,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-23 06:13:41,804 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 06:13:41,805 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:41,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:41,806 INFO L85 PathProgramCache]: Analyzing trace with hash 700915977, now seen corresponding path program 1 times [2022-07-23 06:13:41,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:41,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080755231] [2022-07-23 06:13:41,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:41,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:41,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:41,808 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 06:13:41,810 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 06:13:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:41,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:13:41,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:41,908 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 06:13:41,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:41,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:41,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080755231] [2022-07-23 06:13:41,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080755231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:41,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:41,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:13:41,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051803152] [2022-07-23 06:13:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:41,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:13:41,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:41,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:13:41,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:13:41,912 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:13:41,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:41,947 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-07-23 06:13:41,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:13:41,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-23 06:13:41,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:41,949 INFO L225 Difference]: With dead ends: 83 [2022-07-23 06:13:41,949 INFO L226 Difference]: Without dead ends: 83 [2022-07-23 06:13:41,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:13:41,953 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 19 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:41,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 311 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:13:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-23 06:13:41,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-07-23 06:13:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.5) internal successors, (75), 69 states have internal predecessors, (75), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:13:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-07-23 06:13:41,968 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 14 [2022-07-23 06:13:41,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:41,969 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-07-23 06:13:41,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:13:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-07-23 06:13:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 06:13:41,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:41,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:41,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-23 06:13:42,179 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 06:13:42,179 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:42,180 INFO L85 PathProgramCache]: Analyzing trace with hash 504402472, now seen corresponding path program 1 times [2022-07-23 06:13:42,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:42,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494245309] [2022-07-23 06:13:42,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:42,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:42,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:42,182 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 06:13:42,200 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 06:13:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:42,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:13:42,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:42,289 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 06:13:42,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:42,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:42,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494245309] [2022-07-23 06:13:42,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494245309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:42,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:42,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:13:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579381764] [2022-07-23 06:13:42,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:42,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:13:42,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:42,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:13:42,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:13:42,292 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:13:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:42,356 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-07-23 06:13:42,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:13:42,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-23 06:13:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:42,358 INFO L225 Difference]: With dead ends: 89 [2022-07-23 06:13:42,358 INFO L226 Difference]: Without dead ends: 89 [2022-07-23 06:13:42,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:13:42,359 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 11 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:42,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 378 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:13:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-23 06:13:42,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2022-07-23 06:13:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.462962962962963) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-23 06:13:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2022-07-23 06:13:42,365 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 14 [2022-07-23 06:13:42,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:42,366 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2022-07-23 06:13:42,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:13:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-07-23 06:13:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 06:13:42,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:42,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:42,377 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 06:13:42,576 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 06:13:42,576 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:42,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:42,577 INFO L85 PathProgramCache]: Analyzing trace with hash 458362539, now seen corresponding path program 1 times [2022-07-23 06:13:42,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:42,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425825868] [2022-07-23 06:13:42,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:42,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:42,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:42,579 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 06:13:42,580 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 06:13:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:42,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:13:42,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:42,672 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 06:13:42,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:42,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:42,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425825868] [2022-07-23 06:13:42,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425825868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:42,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:42,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:13:42,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659465949] [2022-07-23 06:13:42,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:42,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:13:42,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:42,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:13:42,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:13:42,674 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 06:13:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:42,696 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-07-23 06:13:42,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:13:42,697 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), 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 16 [2022-07-23 06:13:42,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:42,698 INFO L225 Difference]: With dead ends: 88 [2022-07-23 06:13:42,698 INFO L226 Difference]: Without dead ends: 88 [2022-07-23 06:13:42,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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 06:13:42,699 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 17 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:42,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 232 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:13:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-23 06:13:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-07-23 06:13:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 75 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-23 06:13:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2022-07-23 06:13:42,704 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 16 [2022-07-23 06:13:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:42,704 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2022-07-23 06:13:42,704 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), 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 06:13:42,704 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-07-23 06:13:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 06:13:42,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:42,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:42,715 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 06:13:42,911 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 06:13:42,912 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:42,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:42,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1265077694, now seen corresponding path program 1 times [2022-07-23 06:13:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:42,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255777560] [2022-07-23 06:13:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:42,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:42,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:42,915 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 06:13:42,917 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 06:13:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:42,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:13:42,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:43,017 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 06:13:43,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:13:43,064 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 06:13:43,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:43,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255777560] [2022-07-23 06:13:43,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255777560] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:13:43,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:13:43,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-23 06:13:43,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804980301] [2022-07-23 06:13:43,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:13:43,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:13:43,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:43,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:13:43,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:13:43,066 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 06:13:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:43,140 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-07-23 06:13:43,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:13:43,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 17 [2022-07-23 06:13:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:43,141 INFO L225 Difference]: With dead ends: 91 [2022-07-23 06:13:43,141 INFO L226 Difference]: Without dead ends: 91 [2022-07-23 06:13:43,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:13:43,142 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 34 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:43,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 343 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:13:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-23 06:13:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2022-07-23 06:13:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 78 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-23 06:13:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-07-23 06:13:43,147 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 17 [2022-07-23 06:13:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:43,147 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-07-23 06:13:43,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 06:13:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-07-23 06:13:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 06:13:43,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:43,148 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:43,162 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 06:13:43,356 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 06:13:43,356 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:43,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:43,357 INFO L85 PathProgramCache]: Analyzing trace with hash 876788587, now seen corresponding path program 2 times [2022-07-23 06:13:43,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:43,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657394173] [2022-07-23 06:13:43,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:13:43,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:43,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:43,359 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 06:13:43,360 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 06:13:43,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 06:13:43,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:13:43,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 06:13:43,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:43,426 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 06:13:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-23 06:13:43,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:43,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:43,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657394173] [2022-07-23 06:13:43,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657394173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:43,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:43,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:13:43,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598840370] [2022-07-23 06:13:43,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:43,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:13:43,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:43,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:13:43,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:13:43,493 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 06:13:43,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:43,749 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2022-07-23 06:13:43,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:13:43,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 20 [2022-07-23 06:13:43,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:43,750 INFO L225 Difference]: With dead ends: 94 [2022-07-23 06:13:43,750 INFO L226 Difference]: Without dead ends: 94 [2022-07-23 06:13:43,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:13:43,751 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 35 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:43,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 370 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:13:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-23 06:13:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2022-07-23 06:13:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-23 06:13:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-07-23 06:13:43,756 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 20 [2022-07-23 06:13:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:43,756 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-07-23 06:13:43,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 06:13:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-07-23 06:13:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 06:13:43,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:43,757 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:43,771 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 06:13:43,957 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 06:13:43,958 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:43,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:43,958 INFO L85 PathProgramCache]: Analyzing trace with hash 876788588, now seen corresponding path program 1 times [2022-07-23 06:13:43,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:43,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082063318] [2022-07-23 06:13:43,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:43,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:43,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:43,960 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 06:13:43,961 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 06:13:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:44,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:13:44,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:44,215 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 06:13:44,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:13:44,507 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 06:13:44,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:44,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082063318] [2022-07-23 06:13:44,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082063318] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:13:44,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:13:44,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-23 06:13:44,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369080702] [2022-07-23 06:13:44,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:13:44,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:13:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:44,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:13:44,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:13:44,509 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 06:13:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:45,008 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-07-23 06:13:45,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:13:45,009 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 20 [2022-07-23 06:13:45,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:45,010 INFO L225 Difference]: With dead ends: 96 [2022-07-23 06:13:45,010 INFO L226 Difference]: Without dead ends: 96 [2022-07-23 06:13:45,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:13:45,010 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 32 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:45,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 550 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:13:45,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-23 06:13:45,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2022-07-23 06:13:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.375) internal successors, (88), 83 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-23 06:13:45,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-07-23 06:13:45,017 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 20 [2022-07-23 06:13:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:45,018 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-07-23 06:13:45,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 06:13:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-07-23 06:13:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:13:45,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:45,024 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:45,036 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 06:13:45,234 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 06:13:45,234 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1295948282, now seen corresponding path program 1 times [2022-07-23 06:13:45,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:45,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475002531] [2022-07-23 06:13:45,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:45,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:45,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:45,247 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 06:13:45,249 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 06:13:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:45,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:13:45,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-23 06:13:45,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:45,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:45,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475002531] [2022-07-23 06:13:45,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475002531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:45,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:45,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:13:45,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767880701] [2022-07-23 06:13:45,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:45,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:13:45,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:45,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:13:45,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:13:45,384 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 06:13:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:45,554 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2022-07-23 06:13:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:13:45,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-07-23 06:13:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:45,556 INFO L225 Difference]: With dead ends: 99 [2022-07-23 06:13:45,556 INFO L226 Difference]: Without dead ends: 86 [2022-07-23 06:13:45,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:13:45,557 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 31 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:45,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 148 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:13:45,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-23 06:13:45,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-07-23 06:13:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 75 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:13:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-07-23 06:13:45,560 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 22 [2022-07-23 06:13:45,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:45,560 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-07-23 06:13:45,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 06:13:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-07-23 06:13:45,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:13:45,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:45,561 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:45,590 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 06:13:45,770 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 06:13:45,770 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1092187508, now seen corresponding path program 2 times [2022-07-23 06:13:45,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:45,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162141322] [2022-07-23 06:13:45,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:13:45,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:45,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:45,780 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 06:13:45,825 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 06:13:45,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 06:13:45,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:13:45,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 06:13:45,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:45,930 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 06:13:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-23 06:13:46,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:46,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:46,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162141322] [2022-07-23 06:13:46,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162141322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:46,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:46,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:13:46,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34207043] [2022-07-23 06:13:46,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:46,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:13:46,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:46,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:13:46,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:13:46,234 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 06:13:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:46,623 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-07-23 06:13:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:13:46,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 26 [2022-07-23 06:13:46,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:46,626 INFO L225 Difference]: With dead ends: 96 [2022-07-23 06:13:46,626 INFO L226 Difference]: Without dead ends: 96 [2022-07-23 06:13:46,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:13:46,627 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 43 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:46,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 430 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:13:46,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-23 06:13:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2022-07-23 06:13:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 74 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:13:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-07-23 06:13:46,630 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 26 [2022-07-23 06:13:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:46,630 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-07-23 06:13:46,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 06:13:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-07-23 06:13:46,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:13:46,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:46,645 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] [2022-07-23 06:13:46,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-23 06:13:46,855 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 06:13:46,855 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:46,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:46,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2084512317, now seen corresponding path program 1 times [2022-07-23 06:13:46,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:46,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105716474] [2022-07-23 06:13:46,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:46,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:46,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:46,859 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 06:13:46,861 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 06:13:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:47,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 06:13:47,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:47,472 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 06:13:47,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:13:48,057 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 06:13:48,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:48,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105716474] [2022-07-23 06:13:48,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105716474] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:13:48,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:13:48,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-23 06:13:48,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679675726] [2022-07-23 06:13:48,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:13:48,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 06:13:48,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:48,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 06:13:48,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2022-07-23 06:13:48,059 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:13:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:48,643 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2022-07-23 06:13:48,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 06:13:48,644 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-07-23 06:13:48,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:48,645 INFO L225 Difference]: With dead ends: 87 [2022-07-23 06:13:48,645 INFO L226 Difference]: Without dead ends: 87 [2022-07-23 06:13:48,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2022-07-23 06:13:48,646 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 15 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:48,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 958 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:13:48,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-23 06:13:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-23 06:13:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 80 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:13:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2022-07-23 06:13:48,649 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 30 [2022-07-23 06:13:48,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:48,649 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2022-07-23 06:13:48,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:13:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-07-23 06:13:48,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:13:48,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:48,650 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:48,711 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 06:13:48,850 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 06:13:48,851 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:48,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:48,851 INFO L85 PathProgramCache]: Analyzing trace with hash -532510371, now seen corresponding path program 2 times [2022-07-23 06:13:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:48,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023683341] [2022-07-23 06:13:48,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:13:48,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:48,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:48,857 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 06:13:48,860 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 06:13:49,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 06:13:49,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:13:49,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 06:13:49,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:49,029 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 06:13:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:13:49,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:49,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:49,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023683341] [2022-07-23 06:13:49,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023683341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:49,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:49,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:13:49,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164502678] [2022-07-23 06:13:49,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:49,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:13:49,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:49,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:13:49,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:13:49,174 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:13:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:49,543 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-07-23 06:13:49,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:13:49,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-23 06:13:49,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:49,544 INFO L225 Difference]: With dead ends: 88 [2022-07-23 06:13:49,544 INFO L226 Difference]: Without dead ends: 88 [2022-07-23 06:13:49,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:13:49,545 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 34 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:49,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 341 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:13:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-23 06:13:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-07-23 06:13:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 78 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:13:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-07-23 06:13:49,548 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 36 [2022-07-23 06:13:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:49,548 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-07-23 06:13:49,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:13:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-07-23 06:13:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:13:49,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:49,549 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:49,571 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 06:13:49,762 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 06:13:49,763 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:49,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:49,763 INFO L85 PathProgramCache]: Analyzing trace with hash -532510370, now seen corresponding path program 1 times [2022-07-23 06:13:49,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:49,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448550799] [2022-07-23 06:13:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:49,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:49,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:49,773 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 06:13:49,818 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 06:13:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:49,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 06:13:49,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:49,993 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 06:13:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:13:50,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:50,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:50,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448550799] [2022-07-23 06:13:50,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448550799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:50,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:50,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:13:50,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768698681] [2022-07-23 06:13:50,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:50,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:13:50,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:50,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:13:50,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:13:50,204 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:13:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:50,533 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-07-23 06:13:50,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:13:50,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-23 06:13:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:50,535 INFO L225 Difference]: With dead ends: 90 [2022-07-23 06:13:50,535 INFO L226 Difference]: Without dead ends: 90 [2022-07-23 06:13:50,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:13:50,536 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 38 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:50,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 429 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:13:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-23 06:13:50,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2022-07-23 06:13:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 76 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:13:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-07-23 06:13:50,539 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 36 [2022-07-23 06:13:50,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:50,539 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-07-23 06:13:50,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:13:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-07-23 06:13:50,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:13:50,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:50,540 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:50,556 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 06:13:50,747 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 06:13:50,747 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:50,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:50,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1979095631, now seen corresponding path program 1 times [2022-07-23 06:13:50,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:50,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133261845] [2022-07-23 06:13:50,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:50,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:50,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:50,750 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 06:13:50,754 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 06:13:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:50,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:13:50,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:13:50,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:50,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:50,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133261845] [2022-07-23 06:13:50,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133261845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:50,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:50,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:13:50,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150079671] [2022-07-23 06:13:50,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:50,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:13:50,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:50,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:13:50,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:13:50,985 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:13:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:51,015 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-07-23 06:13:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:13:51,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-23 06:13:51,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:51,017 INFO L225 Difference]: With dead ends: 83 [2022-07-23 06:13:51,017 INFO L226 Difference]: Without dead ends: 83 [2022-07-23 06:13:51,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:13:51,019 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 21 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:51,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 303 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:13:51,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-23 06:13:51,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-23 06:13:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 76 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:13:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-07-23 06:13:51,024 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 36 [2022-07-23 06:13:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:51,026 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-07-23 06:13:51,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:13:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-07-23 06:13:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:13:51,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:51,030 INFO L195 NwaCegarLoop]: trace histogram [16, 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 06:13:51,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-23 06:13:51,244 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 06:13:51,244 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:51,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2103088419, now seen corresponding path program 1 times [2022-07-23 06:13:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:51,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677170661] [2022-07-23 06:13:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:51,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:51,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:51,247 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 06:13:51,249 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 06:13:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:51,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:13:51,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:13:51,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:51,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:51,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677170661] [2022-07-23 06:13:51,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677170661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:51,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:51,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:13:51,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503987405] [2022-07-23 06:13:51,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:51,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:13:51,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:51,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:13:51,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:13:51,504 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:13:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:51,553 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-07-23 06:13:51,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:13:51,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-07-23 06:13:51,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:51,555 INFO L225 Difference]: With dead ends: 83 [2022-07-23 06:13:51,555 INFO L226 Difference]: Without dead ends: 83 [2022-07-23 06:13:51,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:13:51,555 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 27 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:51,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 348 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:13:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-23 06:13:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-23 06:13:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.253968253968254) internal successors, (79), 75 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:13:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-07-23 06:13:51,558 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 38 [2022-07-23 06:13:51,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:51,558 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-07-23 06:13:51,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:13:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-07-23 06:13:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:13:51,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:51,562 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 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 06:13:51,574 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 06:13:51,771 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 06:13:51,772 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:51,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:51,772 INFO L85 PathProgramCache]: Analyzing trace with hash 633351514, now seen corresponding path program 1 times [2022-07-23 06:13:51,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:51,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841210250] [2022-07-23 06:13:51,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:51,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:51,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:51,783 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 06:13:51,835 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 06:13:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:52,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-23 06:13:52,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:52,333 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 06:13:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:13:52,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:52,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:52,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841210250] [2022-07-23 06:13:52,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841210250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:52,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:52,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:13:52,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365465810] [2022-07-23 06:13:52,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:52,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:13:52,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:52,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:13:52,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:13:52,585 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:52,849 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-07-23 06:13:52,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:13:52,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-07-23 06:13:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:52,850 INFO L225 Difference]: With dead ends: 109 [2022-07-23 06:13:52,850 INFO L226 Difference]: Without dead ends: 109 [2022-07-23 06:13:52,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:13:52,851 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 109 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:52,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 223 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 22 Unchecked, 0.2s Time] [2022-07-23 06:13:52,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-23 06:13:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2022-07-23 06:13:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 86 states have internal predecessors, (94), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:13:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-07-23 06:13:52,855 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 46 [2022-07-23 06:13:52,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:52,856 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-07-23 06:13:52,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-07-23 06:13:52,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:13:52,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:52,858 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 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 06:13:52,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-23 06:13:53,069 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 06:13:53,070 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:53,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:53,071 INFO L85 PathProgramCache]: Analyzing trace with hash 633351515, now seen corresponding path program 1 times [2022-07-23 06:13:53,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:53,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987857105] [2022-07-23 06:13:53,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:53,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:53,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:53,080 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 06:13:53,138 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 06:13:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:53,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 06:13:53,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:53,432 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 06:13:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:13:53,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:53,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:53,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987857105] [2022-07-23 06:13:53,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987857105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:53,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:53,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:13:53,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13794921] [2022-07-23 06:13:53,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:53,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:13:53,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:53,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:13:53,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:13:53,816 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:54,288 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-07-23 06:13:54,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 06:13:54,289 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-07-23 06:13:54,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:54,289 INFO L225 Difference]: With dead ends: 97 [2022-07-23 06:13:54,289 INFO L226 Difference]: Without dead ends: 97 [2022-07-23 06:13:54,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-23 06:13:54,290 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 126 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:54,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 330 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 8 Unchecked, 0.4s Time] [2022-07-23 06:13:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-23 06:13:54,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-07-23 06:13:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 86 states have internal predecessors, (91), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-23 06:13:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2022-07-23 06:13:54,294 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 46 [2022-07-23 06:13:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:54,294 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2022-07-23 06:13:54,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:54,295 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-07-23 06:13:54,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-23 06:13:54,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:54,295 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:13:54,326 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 06:13:54,507 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 06:13:54,508 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:54,508 INFO L85 PathProgramCache]: Analyzing trace with hash 438707658, now seen corresponding path program 1 times [2022-07-23 06:13:54,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:54,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551266302] [2022-07-23 06:13:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:54,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:54,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:54,511 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 06:13:54,548 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 06:13:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:54,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:13:54,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:13:54,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:54,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:54,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551266302] [2022-07-23 06:13:54,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551266302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:54,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:54,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:13:54,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652701699] [2022-07-23 06:13:54,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:54,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:13:54,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:54,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:13:54,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:13:54,958 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:13:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:55,083 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-07-23 06:13:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:13:55,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-07-23 06:13:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:55,085 INFO L225 Difference]: With dead ends: 97 [2022-07-23 06:13:55,085 INFO L226 Difference]: Without dead ends: 93 [2022-07-23 06:13:55,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:13:55,086 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 45 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:55,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 407 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:13:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-23 06:13:55,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-07-23 06:13:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 84 states have internal predecessors, (88), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:13:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-07-23 06:13:55,089 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 51 [2022-07-23 06:13:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:55,089 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-07-23 06:13:55,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:13:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-07-23 06:13:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 06:13:55,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:55,092 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:13:55,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-23 06:13:55,302 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 06:13:55,303 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:55,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash 885076734, now seen corresponding path program 1 times [2022-07-23 06:13:55,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:55,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399092842] [2022-07-23 06:13:55,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:55,304 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:55,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:55,306 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 06:13:55,308 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 06:13:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:55,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-23 06:13:55,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:55,636 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 06:13:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:13:55,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:55,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:55,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399092842] [2022-07-23 06:13:55,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399092842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:55,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:55,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:13:55,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406043570] [2022-07-23 06:13:55,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:55,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:13:55,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:55,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:13:55,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:13:55,860 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:56,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:56,288 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-07-23 06:13:56,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:13:56,289 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2022-07-23 06:13:56,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:56,290 INFO L225 Difference]: With dead ends: 119 [2022-07-23 06:13:56,290 INFO L226 Difference]: Without dead ends: 119 [2022-07-23 06:13:56,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-23 06:13:56,291 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 80 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:56,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 278 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 231 Invalid, 0 Unknown, 21 Unchecked, 0.3s Time] [2022-07-23 06:13:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-23 06:13:56,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2022-07-23 06:13:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 100 states have internal predecessors, (110), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-23 06:13:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-07-23 06:13:56,294 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 52 [2022-07-23 06:13:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:56,295 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-07-23 06:13:56,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:56,297 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-07-23 06:13:56,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 06:13:56,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:56,298 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:13:56,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-23 06:13:56,510 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 06:13:56,511 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:56,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:56,511 INFO L85 PathProgramCache]: Analyzing trace with hash 885076735, now seen corresponding path program 1 times [2022-07-23 06:13:56,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:56,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557284381] [2022-07-23 06:13:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:56,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:56,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:56,518 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 06:13:56,521 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 06:13:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:56,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-23 06:13:56,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:56,941 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 06:13:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:13:57,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:57,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:57,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557284381] [2022-07-23 06:13:57,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557284381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:57,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:57,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-23 06:13:57,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102257265] [2022-07-23 06:13:57,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:57,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:13:57,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:57,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:13:57,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:13:57,514 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:58,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:58,075 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-07-23 06:13:58,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:13:58,076 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2022-07-23 06:13:58,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:58,077 INFO L225 Difference]: With dead ends: 131 [2022-07-23 06:13:58,077 INFO L226 Difference]: Without dead ends: 131 [2022-07-23 06:13:58,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:13:58,078 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 152 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:58,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 343 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 193 Invalid, 0 Unknown, 13 Unchecked, 0.4s Time] [2022-07-23 06:13:58,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-23 06:13:58,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2022-07-23 06:13:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 116 states have internal predecessors, (130), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-23 06:13:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 142 transitions. [2022-07-23 06:13:58,087 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 142 transitions. Word has length 52 [2022-07-23 06:13:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:58,087 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 142 transitions. [2022-07-23 06:13:58,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 142 transitions. [2022-07-23 06:13:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-23 06:13:58,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:58,088 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:13:58,116 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 06:13:58,289 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 06:13:58,290 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:13:58,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:58,291 INFO L85 PathProgramCache]: Analyzing trace with hash 516809115, now seen corresponding path program 1 times [2022-07-23 06:13:58,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:58,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322846866] [2022-07-23 06:13:58,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:58,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:58,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:58,293 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 06:13:58,295 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 06:13:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:58,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 06:13:58,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:13:59,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:59,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:59,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322846866] [2022-07-23 06:13:59,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322846866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:59,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:59,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:13:59,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764623429] [2022-07-23 06:13:59,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:59,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:13:59,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:59,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:13:59,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:13:59,306 INFO L87 Difference]: Start difference. First operand 127 states and 142 transitions. Second operand has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:59,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:59,964 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-07-23 06:13:59,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:13:59,966 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2022-07-23 06:13:59,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:59,967 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:13:59,967 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:13:59,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-23 06:13:59,968 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 200 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:59,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 429 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 177 Invalid, 0 Unknown, 12 Unchecked, 0.3s Time] [2022-07-23 06:13:59,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:13:59,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-07-23 06:13:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 116 states have internal predecessors, (129), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-23 06:13:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2022-07-23 06:13:59,981 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 55 [2022-07-23 06:13:59,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:59,981 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2022-07-23 06:13:59,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2022-07-23 06:13:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-23 06:13:59,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:59,989 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:14:00,003 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 06:14:00,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:14:00,200 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:14:00,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:14:00,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1999474558, now seen corresponding path program 1 times [2022-07-23 06:14:00,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:14:00,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116227956] [2022-07-23 06:14:00,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:14:00,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:14:00,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:14:00,203 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:14:00,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-23 06:14:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:14:00,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 06:14:00,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:14:00,668 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 06:14:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:14:00,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:14:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:14:01,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:14:01,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116227956] [2022-07-23 06:14:01,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116227956] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:14:01,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:14:01,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-07-23 06:14:01,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648372925] [2022-07-23 06:14:01,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:14:01,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:14:01,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:14:01,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:14:01,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:14:01,094 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-23 06:14:01,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:14:01,413 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2022-07-23 06:14:01,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:14:01,414 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 59 [2022-07-23 06:14:01,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:14:01,415 INFO L225 Difference]: With dead ends: 137 [2022-07-23 06:14:01,415 INFO L226 Difference]: Without dead ends: 137 [2022-07-23 06:14:01,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:14:01,416 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 97 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:14:01,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 329 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 220 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2022-07-23 06:14:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-23 06:14:01,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2022-07-23 06:14:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.2037037037037037) internal successors, (130), 120 states have internal predecessors, (130), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-23 06:14:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2022-07-23 06:14:01,421 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 59 [2022-07-23 06:14:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:14:01,422 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2022-07-23 06:14:01,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-23 06:14:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2022-07-23 06:14:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 06:14:01,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:14:01,423 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:14:01,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-23 06:14:01,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:14:01,632 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:14:01,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:14:01,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1197288958, now seen corresponding path program 1 times [2022-07-23 06:14:01,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:14:01,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292610409] [2022-07-23 06:14:01,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:14:01,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:14:01,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:14:01,645 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 06:14:01,647 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 06:14:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:14:02,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-23 06:14:02,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:14:02,283 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 14 treesize of output 10 [2022-07-23 06:14:02,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:02,558 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 25 treesize of output 24 [2022-07-23 06:14:02,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:02,637 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 21 treesize of output 20 [2022-07-23 06:14:02,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:02,689 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 21 [2022-07-23 06:14:02,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:02,782 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 21 treesize of output 20 [2022-07-23 06:14:02,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:02,851 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 21 treesize of output 20 [2022-07-23 06:14:03,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:03,003 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 21 treesize of output 20 [2022-07-23 06:14:03,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:03,074 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 21 [2022-07-23 06:14:03,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:03,179 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 21 treesize of output 20 [2022-07-23 06:14:03,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:03,300 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 21 treesize of output 20 [2022-07-23 06:14:03,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:03,349 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 21 treesize of output 20 [2022-07-23 06:14:03,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:03,429 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 21 treesize of output 20 [2022-07-23 06:14:03,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:03,498 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 21 treesize of output 20 [2022-07-23 06:14:03,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:03,590 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 21 treesize of output 20 [2022-07-23 06:14:03,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:03,660 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 21 [2022-07-23 06:14:03,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:03,825 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 21 treesize of output 20 [2022-07-23 06:14:04,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:04,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:04,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:04,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:04,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:04,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:04,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:04,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:04,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:04,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:04,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-23 06:14:09,901 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1756 (_ BitVec 32)) (v_ArrVal_1757 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1756) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1757)) |c_#memory_$Pointer$.offset|)) is different from true [2022-07-23 06:14:09,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:09,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:09,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:09,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-23 06:14:10,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:10,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:10,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:10,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:10,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:10,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:10,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:10,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:10,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:10,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2022-07-23 06:14:10,326 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 15 treesize of output 7 [2022-07-23 06:14:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:14:10,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:14:11,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:14:11,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292610409] [2022-07-23 06:14:11,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292610409] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:14:11,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [354595815] [2022-07-23 06:14:11,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:14:11,526 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:14:11,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:14:11,544 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 06:14:11,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-07-23 06:14:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:14:12,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 118 conjunts are in the unsatisfiable core [2022-07-23 06:14:12,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:14:12,705 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 11 treesize of output 7 [2022-07-23 06:14:12,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:12,750 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 25 treesize of output 24 [2022-07-23 06:14:12,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:12,784 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 25 treesize of output 24 [2022-07-23 06:14:12,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:12,833 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 21 treesize of output 20 [2022-07-23 06:14:12,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:12,867 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 21 treesize of output 20 [2022-07-23 06:14:12,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:12,901 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 21 treesize of output 20 [2022-07-23 06:14:12,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:12,918 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 21 treesize of output 20 [2022-07-23 06:14:12,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:12,943 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 21 [2022-07-23 06:14:12,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:12,957 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 21 treesize of output 20 [2022-07-23 06:14:12,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:12,978 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 21 treesize of output 20 [2022-07-23 06:14:13,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,016 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 21 [2022-07-23 06:14:13,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,062 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 21 [2022-07-23 06:14:13,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,104 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 21 treesize of output 20 [2022-07-23 06:14:13,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,156 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 21 [2022-07-23 06:14:13,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,196 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 21 [2022-07-23 06:14:13,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,213 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 21 treesize of output 20 [2022-07-23 06:14:13,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:13,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-23 06:14:16,655 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1756 (_ BitVec 32)) (v_ArrVal_1953 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1756) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1953)))) is different from true [2022-07-23 06:14:16,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-23 06:14:16,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2022-07-23 06:14:16,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:14:16,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 15 [2022-07-23 06:14:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:14:17,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:14:18,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [354595815] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:14:18,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:14:18,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 44 [2022-07-23 06:14:18,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666288474] [2022-07-23 06:14:18,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:14:18,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-23 06:14:18,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:14:18,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-23 06:14:18,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3198, Unknown=3, NotChecked=230, Total=3660 [2022-07-23 06:14:18,812 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-23 06:14:24,254 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1756 (_ BitVec 32)) (v_ArrVal_1757 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1756) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1757)) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1756 (_ BitVec 32)) (v_ArrVal_1953 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1756) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1953))))) is different from true [2022-07-23 06:14:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:14:25,819 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-07-23 06:14:25,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-23 06:14:25,820 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-07-23 06:14:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:14:25,821 INFO L225 Difference]: With dead ends: 129 [2022-07-23 06:14:25,821 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 06:14:25,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=556, Invalid=7284, Unknown=4, NotChecked=528, Total=8372 [2022-07-23 06:14:25,824 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 211 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-23 06:14:25,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 583 Invalid, 1884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1575 Invalid, 0 Unknown, 253 Unchecked, 2.9s Time] [2022-07-23 06:14:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 06:14:25,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-23 06:14:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 108 states have (on average 1.1666666666666667) internal successors, (126), 118 states have internal predecessors, (126), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-23 06:14:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2022-07-23 06:14:25,831 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 58 [2022-07-23 06:14:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:14:25,831 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2022-07-23 06:14:25,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-23 06:14:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2022-07-23 06:14:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-23 06:14:25,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:14:25,832 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:14:25,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-23 06:14:26,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-07-23 06:14:26,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-23 06:14:26,246 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:14:26,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:14:26,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1538748096, now seen corresponding path program 1 times [2022-07-23 06:14:26,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:14:26,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324622546] [2022-07-23 06:14:26,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:14:26,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:14:26,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:14:26,249 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:14:26,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-23 06:14:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:14:26,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-23 06:14:26,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:14:26,897 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 11 treesize of output 7 [2022-07-23 06:14:26,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:26,946 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 21 [2022-07-23 06:14:26,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:26,992 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 21 [2022-07-23 06:14:27,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:27,068 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 21 [2022-07-23 06:14:27,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:27,146 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 21 treesize of output 20 [2022-07-23 06:14:27,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:27,228 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 21 treesize of output 20 [2022-07-23 06:14:27,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:27,293 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 21 treesize of output 20 [2022-07-23 06:14:27,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:27,341 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 21 treesize of output 20 [2022-07-23 06:14:27,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:27,419 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 21 [2022-07-23 06:14:27,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:27,473 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 21 [2022-07-23 06:14:27,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:27,532 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 21 treesize of output 20 [2022-07-23 06:14:27,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:27,585 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 21 [2022-07-23 06:14:27,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:27,635 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 21 [2022-07-23 06:14:27,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:27,712 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 21 [2022-07-23 06:14:27,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:27,795 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 21 [2022-07-23 06:14:27,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:27,872 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 21 treesize of output 20 [2022-07-23 06:14:28,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:28,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:28,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:28,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:28,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:28,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:28,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:28,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:28,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:28,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:28,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-23 06:14:34,005 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2147 (_ BitVec 32)) (v_ArrVal_2145 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2145) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2147)))) is different from true [2022-07-23 06:14:34,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:34,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:34,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:34,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-23 06:14:34,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:34,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:34,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:34,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:34,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:34,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:34,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:34,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:34,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:34,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2022-07-23 06:14:34,452 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 15 treesize of output 7 [2022-07-23 06:14:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:14:34,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:14:35,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:14:35,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324622546] [2022-07-23 06:14:35,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324622546] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:14:35,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1154897063] [2022-07-23 06:14:35,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:14:35,763 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:14:35,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:14:35,767 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 06:14:35,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-07-23 06:14:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:14:36,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-23 06:14:36,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:14:36,597 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 14 treesize of output 10 [2022-07-23 06:14:36,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:36,642 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 21 [2022-07-23 06:14:36,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:36,674 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 21 treesize of output 20 [2022-07-23 06:14:36,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:36,705 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 21 treesize of output 20 [2022-07-23 06:14:36,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:36,771 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 21 treesize of output 20 [2022-07-23 06:14:36,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:36,796 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 21 [2022-07-23 06:14:36,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:36,835 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 21 [2022-07-23 06:14:36,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:36,880 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 21 treesize of output 20 [2022-07-23 06:14:36,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:36,902 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 21 treesize of output 20 [2022-07-23 06:14:36,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:36,946 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 21 treesize of output 20 [2022-07-23 06:14:36,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:36,984 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 21 treesize of output 20 [2022-07-23 06:14:37,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,003 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 21 treesize of output 20 [2022-07-23 06:14:37,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,054 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 21 treesize of output 20 [2022-07-23 06:14:37,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,097 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 21 treesize of output 20 [2022-07-23 06:14:37,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,179 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 21 [2022-07-23 06:14:37,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,193 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 21 treesize of output 20 [2022-07-23 06:14:37,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:37,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-23 06:14:40,885 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2344 (_ BitVec 32)) (v_ArrVal_2145 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2145) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2344)) |c_#memory_$Pointer$.base|)) is different from true [2022-07-23 06:14:40,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:40,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:40,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:40,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-23 06:14:41,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2022-07-23 06:14:41,283 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:14:41,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 15 [2022-07-23 06:14:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:14:41,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:14:44,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1154897063] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:14:44,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:14:44,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 46 [2022-07-23 06:14:44,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063599353] [2022-07-23 06:14:44,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:14:44,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-23 06:14:44,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:14:44,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-23 06:14:44,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3299, Unknown=3, NotChecked=234, Total=3782 [2022-07-23 06:14:44,244 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-23 06:14:49,242 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2344 (_ BitVec 32)) (v_ArrVal_2145 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2145) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2344)) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2147 (_ BitVec 32)) (v_ArrVal_2145 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2145) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2147))))) is different from true [2022-07-23 06:14:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:14:50,595 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2022-07-23 06:14:50,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-23 06:14:50,596 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2022-07-23 06:14:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:14:50,597 INFO L225 Difference]: With dead ends: 123 [2022-07-23 06:14:50,597 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 06:14:50,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 87 SyntacticMatches, 11 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1566 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=477, Invalid=5231, Unknown=4, NotChecked=450, Total=6162 [2022-07-23 06:14:50,601 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 193 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:14:50,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 415 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1413 Invalid, 0 Unknown, 232 Unchecked, 3.3s Time] [2022-07-23 06:14:50,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 06:14:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-23 06:14:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 110 states have internal predecessors, (114), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-23 06:14:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2022-07-23 06:14:50,621 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 59 [2022-07-23 06:14:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:14:50,622 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2022-07-23 06:14:50,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-23 06:14:50,623 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2022-07-23 06:14:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-23 06:14:50,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:14:50,629 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:14:50,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-07-23 06:14:50,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-23 06:14:51,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:14:51,038 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:14:51,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:14:51,038 INFO L85 PathProgramCache]: Analyzing trace with hash 130971687, now seen corresponding path program 1 times [2022-07-23 06:14:51,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:14:51,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847665548] [2022-07-23 06:14:51,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:14:51,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:14:51,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:14:51,042 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:14:51,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-23 06:14:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:14:51,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-23 06:14:51,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:14:51,615 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 06:14:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:14:52,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:14:52,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:14:52,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847665548] [2022-07-23 06:14:52,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847665548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:14:52,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:14:52,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-23 06:14:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861951] [2022-07-23 06:14:52,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:14:52,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:14:52,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:14:52,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:14:52,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:14:52,169 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand has 13 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:14:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:14:52,802 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-07-23 06:14:52,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:14:52,803 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 65 [2022-07-23 06:14:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:14:52,804 INFO L225 Difference]: With dead ends: 120 [2022-07-23 06:14:52,804 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 06:14:52,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:14:52,805 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 123 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:14:52,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 258 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 0 Unknown, 8 Unchecked, 0.5s Time] [2022-07-23 06:14:52,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 06:14:52,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-23 06:14:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 102 states have (on average 1.0980392156862746) internal successors, (112), 109 states have internal predecessors, (112), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-23 06:14:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2022-07-23 06:14:52,812 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 65 [2022-07-23 06:14:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:14:52,813 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2022-07-23 06:14:52,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:14:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2022-07-23 06:14:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-23 06:14:52,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:14:52,814 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:14:52,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-23 06:14:53,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:14:53,028 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:14:53,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:14:53,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1947249523, now seen corresponding path program 1 times [2022-07-23 06:14:53,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:14:53,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132783957] [2022-07-23 06:14:53,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:14:53,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:14:53,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:14:53,047 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:14:53,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-23 06:14:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:14:53,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 06:14:53,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:14:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:14:54,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:14:54,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:14:54,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132783957] [2022-07-23 06:14:54,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132783957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:14:54,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:14:54,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:14:54,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305198255] [2022-07-23 06:14:54,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:14:54,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:14:54,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:14:54,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:14:54,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:14:54,305 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 13 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:14:54,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:14:54,675 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2022-07-23 06:14:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 06:14:54,677 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-07-23 06:14:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:14:54,677 INFO L225 Difference]: With dead ends: 119 [2022-07-23 06:14:54,678 INFO L226 Difference]: Without dead ends: 119 [2022-07-23 06:14:54,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-23 06:14:54,678 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 117 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:14:54,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 279 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 9 Unchecked, 0.2s Time] [2022-07-23 06:14:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-23 06:14:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-23 06:14:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 102 states have (on average 1.0784313725490196) internal successors, (110), 108 states have internal predecessors, (110), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-23 06:14:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2022-07-23 06:14:54,682 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 68 [2022-07-23 06:14:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:14:54,682 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2022-07-23 06:14:54,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:14:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2022-07-23 06:14:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-23 06:14:54,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:14:54,694 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:14:54,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-23 06:14:54,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:14:54,911 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-23 06:14:54,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:14:54,911 INFO L85 PathProgramCache]: Analyzing trace with hash -418298125, now seen corresponding path program 1 times [2022-07-23 06:14:54,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:14:54,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861182393] [2022-07-23 06:14:54,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:14:54,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:14:54,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:14:54,914 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:14:54,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-23 06:14:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 06:14:55,508 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 06:14:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 06:14:55,913 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-23 06:14:55,914 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-23 06:14:55,915 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2022-07-23 06:14:55,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2022-07-23 06:14:55,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2022-07-23 06:14:55,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2022-07-23 06:14:55,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2022-07-23 06:14:55,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (15 of 21 remaining) [2022-07-23 06:14:55,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2022-07-23 06:14:55,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2022-07-23 06:14:55,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2022-07-23 06:14:55,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2022-07-23 06:14:55,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2022-07-23 06:14:55,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2022-07-23 06:14:55,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2022-07-23 06:14:55,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2022-07-23 06:14:55,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2022-07-23 06:14:55,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2022-07-23 06:14:55,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2022-07-23 06:14:55,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2022-07-23 06:14:55,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2022-07-23 06:14:55,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2022-07-23 06:14:55,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 21 remaining) [2022-07-23 06:14:55,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-23 06:14:56,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:14:56,138 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 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 06:14:56,142 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-23 06:14:56,151 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,177 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,178 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,178 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,181 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,183 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,183 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,184 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,185 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,186 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,186 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,187 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,187 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,187 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,188 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,188 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,191 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,191 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,192 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,192 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,192 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,192 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,192 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,192 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,203 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,204 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,204 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,204 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,204 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,204 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,204 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,206 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,206 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,206 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,206 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,206 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,207 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,207 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,207 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,207 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,207 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,207 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,208 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,208 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,208 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,208 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,209 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,209 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,209 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,209 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,209 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,210 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,210 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,210 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,210 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,210 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,211 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,211 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,211 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,211 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,211 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,212 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,218 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,218 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,219 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,219 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 06:14:56 BoogieIcfgContainer [2022-07-23 06:14:56,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-23 06:14:56,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 06:14:56,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 06:14:56,263 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 06:14:56,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:13:39" (3/4) ... [2022-07-23 06:14:56,266 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-23 06:14:56,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,271 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,271 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,277 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,277 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,277 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,277 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,279 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,279 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,280 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,280 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,280 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,280 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,280 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,287 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,287 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,288 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 06:14:56,288 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 06:14:56,408 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-23 06:14:56,408 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 06:14:56,409 INFO L158 Benchmark]: Toolchain (without parser) took 77971.44ms. Allocated memory was 54.5MB in the beginning and 121.6MB in the end (delta: 67.1MB). Free memory was 31.8MB in the beginning and 49.4MB in the end (delta: -17.7MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2022-07-23 06:14:56,409 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 54.5MB. Free memory was 36.0MB in the beginning and 35.9MB in the end (delta: 52.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:14:56,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.76ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.6MB in the beginning and 35.0MB in the end (delta: -3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 06:14:56,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.17ms. Allocated memory is still 69.2MB. Free memory was 35.0MB in the beginning and 32.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-23 06:14:56,410 INFO L158 Benchmark]: Boogie Preprocessor took 66.49ms. Allocated memory is still 69.2MB. Free memory was 32.3MB in the beginning and 52.1MB in the end (delta: -19.8MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-07-23 06:14:56,410 INFO L158 Benchmark]: RCFGBuilder took 457.71ms. Allocated memory is still 69.2MB. Free memory was 52.1MB in the beginning and 34.0MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-23 06:14:56,411 INFO L158 Benchmark]: TraceAbstraction took 76615.46ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 33.7MB in the beginning and 58.9MB in the end (delta: -25.1MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2022-07-23 06:14:56,411 INFO L158 Benchmark]: Witness Printer took 146.37ms. Allocated memory is still 121.6MB. Free memory was 58.9MB in the beginning and 49.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 06:14:56,423 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.20ms. Allocated memory is still 54.5MB. Free memory was 36.0MB in the beginning and 35.9MB in the end (delta: 52.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 598.76ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.6MB in the beginning and 35.0MB in the end (delta: -3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.17ms. Allocated memory is still 69.2MB. Free memory was 35.0MB in the beginning and 32.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.49ms. Allocated memory is still 69.2MB. Free memory was 32.3MB in the beginning and 52.1MB in the end (delta: -19.8MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * RCFGBuilder took 457.71ms. Allocated memory is still 69.2MB. Free memory was 52.1MB in the beginning and 34.0MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 76615.46ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 33.7MB in the beginning and 58.9MB in the end (delta: -25.1MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Witness Printer took 146.37ms. Allocated memory is still 121.6MB. Free memory was 58.9MB in the beginning and 49.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={1:0}] [L764] CALL entry_point() [L758] struct ldv_kobject *kobj; [L759] CALL, EXPR ldv_kobject_create() [L740] struct ldv_kobject *kobj; VAL [ldv_global_msg_list={1:0}] [L741] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L741] RET, EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_global_msg_list={1:0}, ldv_malloc(sizeof(*kobj))={2:0}] [L741] kobj = ldv_malloc(sizeof(*kobj)) [L742] COND FALSE !(!kobj) [L744] FCALL memset(kobj, 0, sizeof(*kobj)) [L745] CALL ldv_kobject_init(kobj) [L730] COND FALSE !(!kobj) [L733] CALL ldv_kobject_init_internal(kobj) [L723] COND FALSE !(!kobj) [L725] CALL ldv_kref_init(&kobj->kref) [L682] ((&kref->refcount)->counter) = (1) VAL [kref={2:12}, kref={2:12}, ldv_global_msg_list={1:0}] [L725] RET ldv_kref_init(&kobj->kref) [L726] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [ldv_global_msg_list={1:0}, list={2:4}] [L540] list->next = list VAL [ldv_global_msg_list={1:0}, list={2:4}, list={2:4}] [L541] list->prev = list VAL [ldv_global_msg_list={1:0}, list={2:4}, list={2:4}] [L726] RET LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L733] RET ldv_kobject_init_internal(kobj) [L745] RET ldv_kobject_init(kobj) [L746] return kobj; VAL [\result={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L759] RET, EXPR ldv_kobject_create() [L759] kobj = ldv_kobject_create() [L760] CALL ldv_kobject_put(kobj) VAL [ldv_global_msg_list={1:0}] [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL, EXPR ldv_kref_sub(kref, 1, release) [L674] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}] [L666] EXPR v->counter VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}, v->counter=1] [L666] temp = v->counter [L667] temp -= i VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L668] v->counter = temp VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L669] return temp; VAL [\old(i)=1, \result=0, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L674] RET, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L674] COND TRUE (ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0) [L675] CALL release(kref) [L706] const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); [L706] struct ldv_kobject *kobj = ({ const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );}); [L707] CALL ldv_kobject_cleanup(kobj) [L699] EXPR kobj->name VAL [kobj={2:0}, kobj={2:0}, kobj->name={0:0}, ldv_global_msg_list={1:0}] [L699] char *name = kobj->name; [L700] free(kobj) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L700] free(kobj) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L700] free(kobj) [L701] COND FALSE !(\read(*name)) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L707] RET ldv_kobject_cleanup(kobj) [L675] RET release(kref) [L676] return 1; VAL [\old(count)=1, \result=1, count=1, kref={2:12}, kref={2:12}, ldv_global_msg_list={1:0}, release={-1:0}, release={-1:0}] [L690] RET, EXPR ldv_kref_sub(kref, 1, release) [L690] return ldv_kref_sub(kref, 1, release); [L712] RET ldv_kref_put(&kobj->kref, ldv_kobject_release) [L760] RET ldv_kobject_put(kobj) VAL [kobj={2:0}, ldv_global_msg_list={1:0}] [L761] CALL ldv_kobject_put(kobj) VAL [ldv_global_msg_list={1:0}] [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL ldv_kref_sub(kref, 1, release) [L674] CALL ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}] [L666] v->counter - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 763]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 77 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 76.4s, OverallIterations: 28, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1928 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1906 mSDsluCounter, 9992 SdHoareTripleChecker+Invalid, 9.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 630 IncrementalHoareTripleChecker+Unchecked, 8287 mSDsCounter, 346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6173 IncrementalHoareTripleChecker+Invalid, 7149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 346 mSolverCounterUnsat, 1705 mSDtfsCounter, 6173 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1387 GetRequests, 918 SyntacticMatches, 30 SemanticMatches, 439 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3776 ImplicationChecksByTransitivity, 40.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=23, InterpolantAutomatonStates: 321, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 130 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 39.7s InterpolantComputationTime, 1152 NumberOfCodeBlocks, 1122 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1177 ConstructedInterpolants, 88 QuantifiedInterpolants, 7900 SizeOfPredicates, 425 NumberOfNonLiveVariables, 7083 ConjunctsInSsa, 870 ConjunctsInUnsatCore, 33 InterpolantComputations, 21 PerfectInterpolantSequences, 1991/2673 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-23 06:14:56,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)