./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.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-1.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 cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:13:32,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:13:32,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:13:32,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:13:32,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:13:32,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:13:32,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:13:32,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:13:32,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:13:32,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:13:32,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:13:32,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:13:32,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:13:32,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:13:32,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:13:32,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:13:32,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:13:32,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:13:32,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:13:32,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:13:32,151 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:13:32,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:13:32,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:13:32,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:13:32,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:13:32,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:13:32,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:13:32,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:13:32,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:13:32,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:13:32,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:13:32,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:13:32,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:13:32,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:13:32,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:13:32,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:13:32,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:13:32,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:13:32,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:13:32,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:13:32,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:13:32,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:13:32,180 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:32,208 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:13:32,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:13:32,210 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:13:32,210 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:13:32,211 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:13:32,211 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:13:32,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:13:32,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:13:32,212 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:13:32,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:13:32,213 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:13:32,214 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:13:32,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:13:32,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:13:32,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:13:32,214 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:13:32,214 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:13:32,215 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:13:32,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:13:32,215 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:13:32,215 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:13:32,215 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:13:32,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:13:32,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:13:32,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:13:32,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:13:32,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:13:32,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:13:32,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:13:32,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:13:32,217 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 -> cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 [2022-07-23 06:13:32,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:13:32,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:13:32,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:13:32,526 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:13:32,527 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:13:32,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-07-23 06:13:32,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/128cbc9be/f97100935f3a4167b0a434a2d04f0135/FLAG5c5833a74 [2022-07-23 06:13:33,063 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:13:33,063 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-07-23 06:13:33,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/128cbc9be/f97100935f3a4167b0a434a2d04f0135/FLAG5c5833a74 [2022-07-23 06:13:33,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/128cbc9be/f97100935f3a4167b0a434a2d04f0135 [2022-07-23 06:13:33,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:13:33,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:13:33,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:13:33,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:13:33,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:13:33,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:13:33" (1/1) ... [2022-07-23 06:13:33,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ecb6a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:33, skipping insertion in model container [2022-07-23 06:13:33,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:13:33" (1/1) ... [2022-07-23 06:13:33,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:13:33,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:13:34,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:13:34,036 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:34,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@36bfb285 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,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:13:34,038 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 06:13:34,041 INFO L158 Benchmark]: Toolchain (without parser) took 458.28ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 55.5MB in the beginning and 96.6MB in the end (delta: -41.1MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-07-23 06:13:34,042 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:13:34,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.70ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 55.4MB in the beginning and 96.6MB in the end (delta: -41.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-07-23 06:13:34,045 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.19ms. Allocated memory is still 96.5MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.70ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 55.4MB in the beginning and 96.6MB in the end (delta: -41.3MB). Peak memory consumption was 16.6MB. 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-1.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 cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:13:35,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:13:35,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:13:35,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:13:35,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:13:35,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:13:35,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:13:35,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:13:35,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:13:35,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:13:35,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:13:35,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:13:35,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:13:35,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:13:35,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:13:35,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:13:35,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:13:35,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:13:35,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:13:35,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:13:35,965 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:13:35,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:13:35,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:13:35,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:13:35,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:13:35,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:13:35,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:13:35,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:13:35,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:13:35,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:13:35,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:13:35,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:13:35,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:13:35,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:13:35,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:13:35,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:13:35,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:13:35,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:13:35,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:13:35,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:13:35,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:13:35,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:13:35,990 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:36,023 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:13:36,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:13:36,024 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:13:36,025 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:13:36,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:13:36,026 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:13:36,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:13:36,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:13:36,027 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:13:36,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:13:36,028 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:13:36,028 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:13:36,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:13:36,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:13:36,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:13:36,035 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:13:36,035 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:13:36,035 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:13:36,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:13:36,036 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:13:36,036 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 06:13:36,036 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 06:13:36,037 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:13:36,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:13:36,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:13:36,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:13:36,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:13:36,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:13:36,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:13:36,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:13:36,039 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 06:13:36,039 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 06:13:36,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 06:13:36,039 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 -> cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 [2022-07-23 06:13:36,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:13:36,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:13:36,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:13:36,374 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:13:36,375 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:13:36,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-07-23 06:13:36,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25fe81f33/48843ca8c88a4d57b8bad4bd8f8b95d3/FLAG554de73cc [2022-07-23 06:13:37,009 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:13:37,009 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-07-23 06:13:37,033 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25fe81f33/48843ca8c88a4d57b8bad4bd8f8b95d3/FLAG554de73cc [2022-07-23 06:13:37,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25fe81f33/48843ca8c88a4d57b8bad4bd8f8b95d3 [2022-07-23 06:13:37,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:13:37,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:13:37,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:13:37,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:13:37,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:13:37,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:13:37" (1/1) ... [2022-07-23 06:13:37,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71928dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:37, skipping insertion in model container [2022-07-23 06:13:37,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:13:37" (1/1) ... [2022-07-23 06:13:37,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:13:37,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:13:37,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:13:37,936 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 06:13:37,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:13:37,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:13:38,010 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:13:38,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:13:38,137 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:13:38,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:38 WrapperNode [2022-07-23 06:13:38,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:13:38,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:13:38,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:13:38,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:13:38,145 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:38" (1/1) ... [2022-07-23 06:13:38,181 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:38" (1/1) ... [2022-07-23 06:13:38,217 INFO L137 Inliner]: procedures = 167, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 124 [2022-07-23 06:13:38,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:13:38,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:13:38,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:13:38,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:13:38,226 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:38" (1/1) ... [2022-07-23 06:13:38,227 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:38" (1/1) ... [2022-07-23 06:13:38,239 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:38" (1/1) ... [2022-07-23 06:13:38,240 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:38" (1/1) ... [2022-07-23 06:13:38,248 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:38" (1/1) ... [2022-07-23 06:13:38,251 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:38" (1/1) ... [2022-07-23 06:13:38,258 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:38" (1/1) ... [2022-07-23 06:13:38,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:13:38,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:13:38,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:13:38,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:13:38,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:38" (1/1) ... [2022-07-23 06:13:38,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:13:38,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:13:38,305 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:38,315 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:38,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 06:13:38,348 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-07-23 06:13:38,348 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-07-23 06:13:38,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 06:13:38,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 06:13:38,349 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-07-23 06:13:38,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-07-23 06:13:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:13:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:13:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:13:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:13:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 06:13:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:13:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 06:13:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:13:38,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:13:38,543 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:13:38,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:13:38,920 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:13:38,926 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:13:38,927 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 06:13:38,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:13:38 BoogieIcfgContainer [2022-07-23 06:13:38,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:13:38,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:13:38,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:13:38,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:13:38,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:13:37" (1/3) ... [2022-07-23 06:13:38,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7551ce99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:13:38, skipping insertion in model container [2022-07-23 06:13:38,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:13:38" (2/3) ... [2022-07-23 06:13:38,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7551ce99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:13:38, skipping insertion in model container [2022-07-23 06:13:38,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:13:38" (3/3) ... [2022-07-23 06:13:38,943 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2022-07-23 06:13:38,955 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:13:38,956 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-07-23 06:13:39,013 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:13:39,021 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@34691109, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@66e10a0 [2022-07-23 06:13:39,022 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-07-23 06:13:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 59 states have (on average 1.576271186440678) internal successors, (93), 85 states have internal predecessors, (93), 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,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:13:39,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:39,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:39,035 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:39,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:39,041 INFO L85 PathProgramCache]: Analyzing trace with hash 886333963, now seen corresponding path program 1 times [2022-07-23 06:13:39,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:39,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455705446] [2022-07-23 06:13:39,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:39,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:39,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:39,059 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,066 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,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:39,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:13:39,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:39,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:13:39,318 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:39,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:39,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:39,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455705446] [2022-07-23 06:13:39,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455705446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:39,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:39,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:13:39,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650708004] [2022-07-23 06:13:39,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:39,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:13:39,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:39,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:13:39,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:13:39,361 INFO L87 Difference]: Start difference. First operand has 92 states, 59 states have (on average 1.576271186440678) internal successors, (93), 85 states have internal predecessors, (93), 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:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:39,724 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2022-07-23 06:13:39,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:13:39,727 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:39,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:39,735 INFO L225 Difference]: With dead ends: 158 [2022-07-23 06:13:39,736 INFO L226 Difference]: Without dead ends: 156 [2022-07-23 06:13:39,737 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:39,741 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 97 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:39,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 387 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:13:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-23 06:13:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 95. [2022-07-23 06:13:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 87 states have internal predecessors, (96), 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:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2022-07-23 06:13:39,780 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 10 [2022-07-23 06:13:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:39,781 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2022-07-23 06:13:39,781 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:39,781 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2022-07-23 06:13:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:13:39,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:39,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:39,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-23 06:13:39,991 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:39,992 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:39,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:39,992 INFO L85 PathProgramCache]: Analyzing trace with hash 914963114, now seen corresponding path program 1 times [2022-07-23 06:13:39,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:39,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418369164] [2022-07-23 06:13:39,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:39,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:39,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:39,996 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:39,999 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,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:40,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:13:40,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:13:40,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:40,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:40,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418369164] [2022-07-23 06:13:40,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418369164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:40,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:40,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:13:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464256142] [2022-07-23 06:13:40,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:40,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:13:40,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:40,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:13:40,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:13:40,163 INFO L87 Difference]: Start difference. First operand 95 states and 105 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,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:40,193 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-07-23 06:13:40,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:13:40,194 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,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:40,195 INFO L225 Difference]: With dead ends: 114 [2022-07-23 06:13:40,195 INFO L226 Difference]: Without dead ends: 114 [2022-07-23 06:13:40,195 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,197 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 19 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 393 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,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 393 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,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-23 06:13:40,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2022-07-23 06:13:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 85 states have internal predecessors, (93), 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,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2022-07-23 06:13:40,205 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 10 [2022-07-23 06:13:40,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:40,205 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2022-07-23 06:13:40,206 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,206 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2022-07-23 06:13:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 06:13:40,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:40,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:40,218 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:40,415 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:40,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:40,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:40,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1706549126, now seen corresponding path program 1 times [2022-07-23 06:13:40,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:40,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295142475] [2022-07-23 06:13:40,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:40,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:40,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:40,420 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:40,422 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:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:40,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 06:13:40,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:40,507 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,585 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,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:40,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:40,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295142475] [2022-07-23 06:13:40,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295142475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:40,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:40,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:13:40,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908547623] [2022-07-23 06:13:40,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:40,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:13:40,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:40,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:13:40,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:13:40,589 INFO L87 Difference]: Start difference. First operand 93 states and 102 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:40,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:40,958 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-07-23 06:13:40,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:13:40,961 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:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:40,962 INFO L225 Difference]: With dead ends: 134 [2022-07-23 06:13:40,962 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 06:13:40,963 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:40,964 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 73 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:40,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 469 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:13:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 06:13:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 92. [2022-07-23 06:13:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 84 states have internal predecessors, (92), 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,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-07-23 06:13:40,980 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 11 [2022-07-23 06:13:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:40,980 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-07-23 06:13:40,981 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:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-07-23 06:13:40,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 06:13:40,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:40,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:40,991 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,190 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,191 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:41,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:41,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1363388625, now seen corresponding path program 1 times [2022-07-23 06:13:41,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:41,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330557573] [2022-07-23 06:13:41,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:41,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:41,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:41,194 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,197 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,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:41,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:13:41,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:41,294 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,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:41,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:41,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330557573] [2022-07-23 06:13:41,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330557573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:41,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:41,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:13:41,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875902460] [2022-07-23 06:13:41,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:41,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:13:41,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:41,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:13:41,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:13:41,296 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:41,324 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2022-07-23 06:13:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:13:41,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2022-07-23 06:13:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:41,325 INFO L225 Difference]: With dead ends: 113 [2022-07-23 06:13:41,325 INFO L226 Difference]: Without dead ends: 113 [2022-07-23 06:13:41,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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,332 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 35 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 423 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,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 423 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,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-23 06:13:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2022-07-23 06:13:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 84 states have internal predecessors, (91), 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,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-07-23 06:13:41,351 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 12 [2022-07-23 06:13:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:41,352 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-07-23 06:13:41,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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,352 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-07-23 06:13:41,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 06:13:41,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:41,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:41,366 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:41,561 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:41,562 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:41,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:41,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1188768336, now seen corresponding path program 1 times [2022-07-23 06:13:41,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:41,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428260125] [2022-07-23 06:13:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:41,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:41,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:41,565 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:41,568 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:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:41,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 06:13:41,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:41,668 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,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:41,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:41,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428260125] [2022-07-23 06:13:41,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428260125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:41,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:41,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:13:41,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123296173] [2022-07-23 06:13:41,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:41,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:13:41,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:41,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:13:41,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:13:41,670 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:41,700 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2022-07-23 06:13:41,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:13:41,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2022-07-23 06:13:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:41,704 INFO L225 Difference]: With dead ends: 112 [2022-07-23 06:13:41,705 INFO L226 Difference]: Without dead ends: 112 [2022-07-23 06:13:41,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:13:41,706 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 21 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:41,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 288 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:13:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-23 06:13:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2022-07-23 06:13:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 86 states have internal predecessors, (93), 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,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2022-07-23 06:13:41,711 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 12 [2022-07-23 06:13:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:41,712 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2022-07-23 06:13:41,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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,712 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-07-23 06:13:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 06:13:41,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:41,712 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:41,723 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:41,921 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:41,922 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:41,922 INFO L85 PathProgramCache]: Analyzing trace with hash 86428473, now seen corresponding path program 1 times [2022-07-23 06:13:41,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:41,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105950358] [2022-07-23 06:13:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:41,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:41,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:41,924 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:41,925 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:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:41,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:13:41,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:42,001 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,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:42,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:42,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105950358] [2022-07-23 06:13:42,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105950358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:42,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:42,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:13:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797361025] [2022-07-23 06:13:42,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:42,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:13:42,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:13:42,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:13:42,003 INFO L87 Difference]: Start difference. First operand 94 states and 102 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,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:42,029 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-07-23 06:13:42,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:13:42,030 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,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:42,031 INFO L225 Difference]: With dead ends: 104 [2022-07-23 06:13:42,031 INFO L226 Difference]: Without dead ends: 104 [2022-07-23 06:13:42,031 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,031 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 33 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 208 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,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 208 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,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-23 06:13:42,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2022-07-23 06:13:42,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.46875) internal successors, (94), 87 states have internal predecessors, (94), 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:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-07-23 06:13:42,036 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 16 [2022-07-23 06:13:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:42,037 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-07-23 06:13:42,037 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,037 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-07-23 06:13:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 06:13:42,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:42,037 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,049 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,246 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,247 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:42,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:42,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1674943760, now seen corresponding path program 1 times [2022-07-23 06:13:42,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:42,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083737938] [2022-07-23 06:13:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:42,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:42,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:42,249 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,250 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,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:42,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:13:42,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:42,352 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:42,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:13:42,407 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:42,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:42,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083737938] [2022-07-23 06:13:42,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083737938] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:13:42,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:13:42,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-23 06:13:42,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425574823] [2022-07-23 06:13:42,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:13:42,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:13:42,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:42,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:13:42,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:13:42,409 INFO L87 Difference]: Start difference. First operand 95 states and 103 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:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:42,474 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-07-23 06:13:42,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:13:42,475 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:42,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:42,475 INFO L225 Difference]: With dead ends: 107 [2022-07-23 06:13:42,475 INFO L226 Difference]: Without dead ends: 107 [2022-07-23 06:13:42,476 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:42,476 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 66 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:42,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 381 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:13:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-23 06:13:42,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2022-07-23 06:13:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 90 states have internal predecessors, (97), 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:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2022-07-23 06:13:42,481 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 17 [2022-07-23 06:13:42,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:42,481 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2022-07-23 06:13:42,481 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:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-07-23 06:13:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 06:13:42,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:42,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:42,494 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:42,682 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:42,683 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:42,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:42,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1276371002, now seen corresponding path program 1 times [2022-07-23 06:13:42,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:42,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188601220] [2022-07-23 06:13:42,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:42,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:42,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:42,685 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:42,686 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:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:42,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 06:13:42,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:42,835 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,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:42,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:42,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188601220] [2022-07-23 06:13:42,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188601220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:42,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:42,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:13:42,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873141898] [2022-07-23 06:13:42,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:42,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:13:42,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:42,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:13:42,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:13:42,837 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:42,913 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-07-23 06:13:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:13:42,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 18 [2022-07-23 06:13:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:42,915 INFO L225 Difference]: With dead ends: 113 [2022-07-23 06:13:42,915 INFO L226 Difference]: Without dead ends: 113 [2022-07-23 06:13:42,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:13:42,915 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 21 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:42,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 545 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:13:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-23 06:13:42,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-07-23 06:13:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 98 states have internal predecessors, (104), 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,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2022-07-23 06:13:42,920 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 18 [2022-07-23 06:13:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:42,932 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2022-07-23 06:13:42,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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,932 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-07-23 06:13:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 06:13:42,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:42,935 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:42,949 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,144 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,144 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:43,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1965719801, now seen corresponding path program 2 times [2022-07-23 06:13:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:43,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141834540] [2022-07-23 06:13:43,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:13:43,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:43,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:43,147 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,148 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:43,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 06:13:43,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:13:43,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 06:13:43,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:43,218 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,281 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,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:43,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:43,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141834540] [2022-07-23 06:13:43,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141834540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:43,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:43,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:13:43,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665330782] [2022-07-23 06:13:43,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:43,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:13:43,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:43,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:13:43,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:13:43,284 INFO L87 Difference]: Start difference. First operand 108 states and 117 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,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:43,594 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-07-23 06:13:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:13:43,595 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,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:43,596 INFO L225 Difference]: With dead ends: 142 [2022-07-23 06:13:43,596 INFO L226 Difference]: Without dead ends: 142 [2022-07-23 06:13:43,596 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,597 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 95 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:43,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 537 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:13:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-23 06:13:43,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 107. [2022-07-23 06:13:43,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 97 states have internal predecessors, (103), 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,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2022-07-23 06:13:43,602 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 20 [2022-07-23 06:13:43,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:43,602 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2022-07-23 06:13:43,602 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,603 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2022-07-23 06:13:43,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 06:13:43,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:43,603 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,614 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:43,812 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:43,812 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:43,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:43,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1965719802, now seen corresponding path program 1 times [2022-07-23 06:13:43,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:43,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663038842] [2022-07-23 06:13:43,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:43,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:43,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:43,814 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:43,815 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:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:43,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:13:43,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:43,978 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:43,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:13:44,143 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,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:44,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663038842] [2022-07-23 06:13:44,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663038842] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:13:44,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:13:44,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-23 06:13:44,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536565495] [2022-07-23 06:13:44,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:13:44,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:13:44,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:44,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:13:44,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:13:44,146 INFO L87 Difference]: Start difference. First operand 107 states and 116 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:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:44,397 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-07-23 06:13:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:13:44,398 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:44,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:44,399 INFO L225 Difference]: With dead ends: 116 [2022-07-23 06:13:44,399 INFO L226 Difference]: Without dead ends: 116 [2022-07-23 06:13:44,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:13:44,400 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 64 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:44,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 782 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:13:44,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-23 06:13:44,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2022-07-23 06:13:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 80 states have (on average 1.3625) internal successors, (109), 103 states have internal predecessors, (109), 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:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2022-07-23 06:13:44,404 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 20 [2022-07-23 06:13:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:44,404 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2022-07-23 06:13:44,404 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:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2022-07-23 06:13:44,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:13:44,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:44,405 INFO L195 NwaCegarLoop]: trace 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] [2022-07-23 06:13:44,417 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:44,605 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:44,606 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:44,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1184735654, now seen corresponding path program 1 times [2022-07-23 06:13:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:44,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401140456] [2022-07-23 06:13:44,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:44,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:44,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:44,608 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:44,609 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:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:44,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:13:44,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:44,729 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:44,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:44,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:44,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401140456] [2022-07-23 06:13:44,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401140456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:44,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:44,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:13:44,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068680249] [2022-07-23 06:13:44,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:44,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:13:44,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:44,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:13:44,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:13:44,731 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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:44,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:44,861 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-07-23 06:13:44,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:13:44,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 27 [2022-07-23 06:13:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:44,862 INFO L225 Difference]: With dead ends: 119 [2022-07-23 06:13:44,862 INFO L226 Difference]: Without dead ends: 101 [2022-07-23 06:13:44,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:44,863 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 31 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:44,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 188 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:13:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-23 06:13:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2022-07-23 06:13:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.411764705882353) internal successors, (96), 90 states have internal predecessors, (96), 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:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-07-23 06:13:44,866 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 27 [2022-07-23 06:13:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:44,866 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-07-23 06:13:44,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-07-23 06:13:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:13:44,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:44,867 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:44,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-23 06:13:45,079 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:45,080 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:45,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:45,080 INFO L85 PathProgramCache]: Analyzing trace with hash -103060070, now seen corresponding path program 2 times [2022-07-23 06:13:45,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:45,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682798917] [2022-07-23 06:13:45,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:13:45,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:45,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:45,082 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:45,083 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:45,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 06:13:45,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:13:45,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 06:13:45,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:45,179 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:45,358 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:45,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:45,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:45,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682798917] [2022-07-23 06:13:45,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682798917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:45,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:45,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:13:45,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673895] [2022-07-23 06:13:45,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:45,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:13:45,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:45,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:13:45,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:13:45,361 INFO L87 Difference]: Start difference. First operand 97 states and 104 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:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:45,864 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2022-07-23 06:13:45,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:13:45,865 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:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:45,866 INFO L225 Difference]: With dead ends: 141 [2022-07-23 06:13:45,866 INFO L226 Difference]: Without dead ends: 141 [2022-07-23 06:13:45,866 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:45,867 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 105 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:45,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 620 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:13:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-23 06:13:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2022-07-23 06:13:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 89 states have internal predecessors, (95), 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,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-07-23 06:13:45,871 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2022-07-23 06:13:45,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:45,871 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-07-23 06:13:45,871 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:45,871 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-07-23 06:13:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:13:45,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:45,872 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:45,883 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:46,072 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:46,073 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:46,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:46,073 INFO L85 PathProgramCache]: Analyzing trace with hash -257987495, now seen corresponding path program 1 times [2022-07-23 06:13:46,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:46,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963596283] [2022-07-23 06:13:46,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:46,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:46,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:46,075 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:46,076 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:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:46,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 06:13:46,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:13:46,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:13:46,747 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:46,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:46,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963596283] [2022-07-23 06:13:46,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963596283] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:13:46,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:13:46,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-23 06:13:46,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937687429] [2022-07-23 06:13:46,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:13:46,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 06:13:46,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:46,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 06:13:46,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2022-07-23 06:13:46,751 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:47,168 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-07-23 06:13:47,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 06:13:47,168 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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 28 [2022-07-23 06:13:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:47,169 INFO L225 Difference]: With dead ends: 102 [2022-07-23 06:13:47,169 INFO L226 Difference]: Without dead ends: 102 [2022-07-23 06:13:47,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2022-07-23 06:13:47,170 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 31 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:47,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1236 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:13:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-23 06:13:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-23 06:13:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.364864864864865) internal successors, (101), 95 states have internal predecessors, (101), 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:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-07-23 06:13:47,174 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 28 [2022-07-23 06:13:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:47,174 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-07-23 06:13:47,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-07-23 06:13:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:13:47,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:47,175 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:47,188 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:47,375 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:47,376 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:47,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:47,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2039891719, now seen corresponding path program 2 times [2022-07-23 06:13:47,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:47,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430086840] [2022-07-23 06:13:47,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:13:47,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:47,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:47,378 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:47,379 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:47,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 06:13:47,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:13:47,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:13:47,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:47,528 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:47,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:47,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:47,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430086840] [2022-07-23 06:13:47,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430086840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:47,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:47,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:13:47,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412024471] [2022-07-23 06:13:47,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:47,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:13:47,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:47,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:13:47,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:13:47,530 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:47,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:47,569 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-07-23 06:13:47,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:13:47,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 34 [2022-07-23 06:13:47,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:47,571 INFO L225 Difference]: With dead ends: 102 [2022-07-23 06:13:47,571 INFO L226 Difference]: Without dead ends: 102 [2022-07-23 06:13:47,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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:47,572 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 53 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 371 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:47,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 371 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:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-23 06:13:47,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-23 06:13:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 95 states have internal predecessors, (100), 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:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-07-23 06:13:47,575 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 34 [2022-07-23 06:13:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:47,575 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-07-23 06:13:47,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-07-23 06:13:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:13:47,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:47,576 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:47,585 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:47,785 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:47,785 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:47,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:47,786 INFO L85 PathProgramCache]: Analyzing trace with hash -382086172, now seen corresponding path program 1 times [2022-07-23 06:13:47,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:47,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116842701] [2022-07-23 06:13:47,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:47,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:47,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:47,788 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:47,790 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:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:47,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 06:13:47,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:47,971 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:48,070 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:48,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:48,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:48,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116842701] [2022-07-23 06:13:48,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116842701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:48,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:48,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:13:48,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869071053] [2022-07-23 06:13:48,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:48,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:13:48,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:48,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:13:48,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:13:48,072 INFO L87 Difference]: Start difference. First operand 102 states and 108 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:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:48,360 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-07-23 06:13:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:13:48,360 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:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:48,361 INFO L225 Difference]: With dead ends: 100 [2022-07-23 06:13:48,361 INFO L226 Difference]: Without dead ends: 100 [2022-07-23 06:13:48,362 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:48,362 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 77 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:48,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 391 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:13:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-23 06:13:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-23 06:13:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 93 states have internal predecessors, (98), 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,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-07-23 06:13:48,365 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 36 [2022-07-23 06:13:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:48,366 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-07-23 06:13:48,366 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:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-07-23 06:13:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:13:48,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:48,367 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,378 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:48,578 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:48,578 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:48,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:48,579 INFO L85 PathProgramCache]: Analyzing trace with hash -382086171, now seen corresponding path program 1 times [2022-07-23 06:13:48,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:48,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056880948] [2022-07-23 06:13:48,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:48,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:48,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:48,581 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:48,584 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:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:48,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 06:13:48,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:48,791 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,011 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,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:49,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:49,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056880948] [2022-07-23 06:13:49,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056880948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:49,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:49,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:13:49,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791890242] [2022-07-23 06:13:49,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:49,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:13:49,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:49,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:13:49,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:13:49,013 INFO L87 Difference]: Start difference. First operand 100 states and 106 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:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:49,387 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-07-23 06:13:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:13:49,388 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:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:49,389 INFO L225 Difference]: With dead ends: 98 [2022-07-23 06:13:49,389 INFO L226 Difference]: Without dead ends: 98 [2022-07-23 06:13:49,389 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:49,390 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 84 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:49,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 472 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:13:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-23 06:13:49,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-23 06:13:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 91 states have internal predecessors, (96), 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,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2022-07-23 06:13:49,393 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 36 [2022-07-23 06:13:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:49,393 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2022-07-23 06:13:49,393 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:49,394 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2022-07-23 06:13:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:13:49,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:49,394 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,415 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:49,606 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:49,606 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:49,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:49,606 INFO L85 PathProgramCache]: Analyzing trace with hash -432796251, now seen corresponding path program 1 times [2022-07-23 06:13:49,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:49,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875704162] [2022-07-23 06:13:49,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:49,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:49,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:49,608 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:49,610 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:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:49,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:13:49,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:49,855 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,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:49,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:49,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875704162] [2022-07-23 06:13:49,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875704162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:49,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:49,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:13:49,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630325458] [2022-07-23 06:13:49,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:49,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:13:49,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:49,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:13:49,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:13:49,859 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:49,912 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-07-23 06:13:49,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:13:49,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 36 [2022-07-23 06:13:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:49,917 INFO L225 Difference]: With dead ends: 98 [2022-07-23 06:13:49,917 INFO L226 Difference]: Without dead ends: 98 [2022-07-23 06:13:49,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 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:49,920 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 75 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 396 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:49,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 396 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:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-23 06:13:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-23 06:13:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 90 states have internal predecessors, (95), 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,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2022-07-23 06:13:49,928 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 36 [2022-07-23 06:13:49,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:49,929 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2022-07-23 06:13:49,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-07-23 06:13:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 06:13:49,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:49,931 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] [2022-07-23 06:13:49,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-23 06:13:50,142 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:50,142 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:50,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:50,143 INFO L85 PathProgramCache]: Analyzing trace with hash 74876930, now seen corresponding path program 1 times [2022-07-23 06:13:50,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:50,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985725409] [2022-07-23 06:13:50,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:50,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:50,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:50,145 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:50,146 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:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:50,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-23 06:13:50,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:50,338 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,477 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,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:50,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:50,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985725409] [2022-07-23 06:13:50,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985725409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:50,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:50,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:13:50,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92650716] [2022-07-23 06:13:50,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:50,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:13:50,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:50,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:13:50,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:13:50,482 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:50,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:50,754 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-07-23 06:13:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:13:50,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-23 06:13:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:50,756 INFO L225 Difference]: With dead ends: 100 [2022-07-23 06:13:50,756 INFO L226 Difference]: Without dead ends: 100 [2022-07-23 06:13:50,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:13:50,756 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 65 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:50,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 347 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 20 Unchecked, 0.2s Time] [2022-07-23 06:13:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-23 06:13:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-07-23 06:13:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 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,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2022-07-23 06:13:50,761 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 44 [2022-07-23 06:13:50,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:50,761 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2022-07-23 06:13:50,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:50,761 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-07-23 06:13:50,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 06:13:50,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:50,762 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] [2022-07-23 06:13:50,778 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:50,971 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:50,972 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:50,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:50,972 INFO L85 PathProgramCache]: Analyzing trace with hash 74876931, now seen corresponding path program 1 times [2022-07-23 06:13:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:50,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830387405] [2022-07-23 06:13:50,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:50,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:50,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:50,974 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:50,975 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:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:51,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 06:13:51,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:51,221 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:51,486 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,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:51,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:51,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830387405] [2022-07-23 06:13:51,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830387405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:51,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:51,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:13:51,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647885914] [2022-07-23 06:13:51,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:51,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:13:51,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:51,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:13:51,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:13:51,488 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:51,828 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-07-23 06:13:51,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:13:51,829 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-23 06:13:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:51,829 INFO L225 Difference]: With dead ends: 103 [2022-07-23 06:13:51,830 INFO L226 Difference]: Without dead ends: 103 [2022-07-23 06:13:51,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:13:51,830 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 70 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:51,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 473 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 173 Invalid, 0 Unknown, 17 Unchecked, 0.3s Time] [2022-07-23 06:13:51,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-23 06:13:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2022-07-23 06:13:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 86 states have internal predecessors, (91), 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,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2022-07-23 06:13:51,834 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 44 [2022-07-23 06:13:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:51,835 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2022-07-23 06:13:51,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-07-23 06:13:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-23 06:13:51,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:51,836 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] [2022-07-23 06:13:51,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-23 06:13:52,048 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:52,048 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:52,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:52,049 INFO L85 PathProgramCache]: Analyzing trace with hash 496438540, now seen corresponding path program 1 times [2022-07-23 06:13:52,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:52,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953070191] [2022-07-23 06:13:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:52,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:52,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:52,051 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:52,067 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:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:52,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:13:52,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:52,341 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,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:52,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:52,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953070191] [2022-07-23 06:13:52,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953070191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:52,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:52,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:13:52,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361293866] [2022-07-23 06:13:52,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:52,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:13:52,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:52,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:13:52,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:13:52,344 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:52,409 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-07-23 06:13:52,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:13:52,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-07-23 06:13:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:52,411 INFO L225 Difference]: With dead ends: 94 [2022-07-23 06:13:52,411 INFO L226 Difference]: Without dead ends: 94 [2022-07-23 06:13:52,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 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:52,412 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 42 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:52,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 394 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:13:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-23 06:13:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-23 06:13:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 86 states have internal predecessors, (90), 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:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-07-23 06:13:52,415 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 50 [2022-07-23 06:13:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:52,415 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-07-23 06:13:52,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:13:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-07-23 06:13:52,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-23 06:13:52,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:52,416 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] [2022-07-23 06:13:52,430 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:52,629 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:52,629 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:52,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:52,630 INFO L85 PathProgramCache]: Analyzing trace with hash -774905870, now seen corresponding path program 1 times [2022-07-23 06:13:52,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:52,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430753895] [2022-07-23 06:13:52,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:52,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:52,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:52,632 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:52,633 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:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:52,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 06:13:52,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:52,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:13:53,098 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,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:53,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:53,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430753895] [2022-07-23 06:13:53,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430753895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:53,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:53,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:13:53,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544722981] [2022-07-23 06:13:53,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:53,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:13:53,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:53,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:13:53,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:13:53,100 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 12 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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:53,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:53,426 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2022-07-23 06:13:53,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:13:53,427 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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 56 [2022-07-23 06:13:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:53,428 INFO L225 Difference]: With dead ends: 123 [2022-07-23 06:13:53,428 INFO L226 Difference]: Without dead ends: 123 [2022-07-23 06:13:53,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-23 06:13:53,428 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 138 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:53,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 345 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 208 Invalid, 0 Unknown, 17 Unchecked, 0.3s Time] [2022-07-23 06:13:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-23 06:13:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2022-07-23 06:13:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 100 states have internal predecessors, (107), 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:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-07-23 06:13:53,433 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 56 [2022-07-23 06:13:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:53,433 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-07-23 06:13:53,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-07-23 06:13:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-23 06:13:53,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:53,434 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] [2022-07-23 06:13:53,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-23 06:13:53,634 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:53,634 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:53,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:53,635 INFO L85 PathProgramCache]: Analyzing trace with hash -774905869, now seen corresponding path program 1 times [2022-07-23 06:13:53,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:53,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582805054] [2022-07-23 06:13:53,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:53,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:53,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:53,637 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:53,638 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:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:53,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 06:13:53,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:53,917 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:54,265 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:54,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:54,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:54,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582805054] [2022-07-23 06:13:54,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582805054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:54,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:54,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-23 06:13:54,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78600023] [2022-07-23 06:13:54,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:54,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:13:54,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:54,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:13:54,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:13:54,267 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:54,714 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-07-23 06:13:54,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:13:54,715 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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 56 [2022-07-23 06:13:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:54,716 INFO L225 Difference]: With dead ends: 111 [2022-07-23 06:13:54,716 INFO L226 Difference]: Without dead ends: 111 [2022-07-23 06:13:54,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:13:54,717 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 150 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:54,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 431 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 235 Invalid, 0 Unknown, 8 Unchecked, 0.3s Time] [2022-07-23 06:13:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-23 06:13:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2022-07-23 06:13:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 98 states have internal predecessors, (103), 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,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2022-07-23 06:13:54,721 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 56 [2022-07-23 06:13:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:54,722 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2022-07-23 06:13:54,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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,722 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2022-07-23 06:13:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-23 06:13:54,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:54,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:54,739 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:13:54,937 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:13:54,938 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:54,938 INFO L85 PathProgramCache]: Analyzing trace with hash -178952659, now seen corresponding path program 1 times [2022-07-23 06:13:54,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:54,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806509252] [2022-07-23 06:13:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:54,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:54,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:54,940 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:13:54,941 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:13:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:55,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:13:55,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:55,322 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:55,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:55,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:55,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806509252] [2022-07-23 06:13:55,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806509252] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:55,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:55,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:13:55,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578656663] [2022-07-23 06:13:55,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:55,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:13:55,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:55,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:13:55,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:13:55,324 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:55,451 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-07-23 06:13:55,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:13:55,452 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 62 [2022-07-23 06:13:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:55,453 INFO L225 Difference]: With dead ends: 111 [2022-07-23 06:13:55,453 INFO L226 Difference]: Without dead ends: 107 [2022-07-23 06:13:55,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:13:55,454 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 71 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:55,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 514 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:13:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-23 06:13:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-23 06:13:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 98 states have internal predecessors, (101), 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:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2022-07-23 06:13:55,458 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 62 [2022-07-23 06:13:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:55,458 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2022-07-23 06:13:55,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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,459 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-07-23 06:13:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-23 06:13:55,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:55,459 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, 1, 1, 1] [2022-07-23 06:13:55,474 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:13:55,660 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:13:55,660 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:55,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:55,661 INFO L85 PathProgramCache]: Analyzing trace with hash 59491574, now seen corresponding path program 1 times [2022-07-23 06:13:55,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:55,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460035849] [2022-07-23 06:13:55,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:55,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:55,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:55,663 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:13:55,664 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:13:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:56,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 06:13:56,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:56,048 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:56,214 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:56,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:56,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:56,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460035849] [2022-07-23 06:13:56,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460035849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:56,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:56,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-23 06:13:56,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925166919] [2022-07-23 06:13:56,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:56,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:13:56,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:56,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:13:56,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:13:56,217 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:56,612 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-07-23 06:13:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:13:56,613 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 62 [2022-07-23 06:13:56,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:56,614 INFO L225 Difference]: With dead ends: 116 [2022-07-23 06:13:56,614 INFO L226 Difference]: Without dead ends: 116 [2022-07-23 06:13:56,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:13:56,615 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 98 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:56,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 465 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 330 Invalid, 0 Unknown, 18 Unchecked, 0.3s Time] [2022-07-23 06:13:56,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-23 06:13:56,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2022-07-23 06:13:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.146067415730337) internal successors, (102), 98 states have internal predecessors, (102), 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:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2022-07-23 06:13:56,620 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 62 [2022-07-23 06:13:56,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:56,621 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2022-07-23 06:13:56,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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,621 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-07-23 06:13:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-23 06:13:56,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:56,623 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, 1, 1, 1] [2022-07-23 06:13:56,640 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:13:56,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:13:56,837 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:56,838 INFO L85 PathProgramCache]: Analyzing trace with hash 59491575, now seen corresponding path program 1 times [2022-07-23 06:13:56,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:56,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936283880] [2022-07-23 06:13:56,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:56,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:56,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:56,840 INFO L229 MonitoredProcess]: Starting monitored process 26 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,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-23 06:13:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:57,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-23 06:13:57,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:57,172 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,504 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,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:57,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:57,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936283880] [2022-07-23 06:13:57,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936283880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:57,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:57,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-23 06:13:57,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465222063] [2022-07-23 06:13:57,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:57,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:13:57,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:57,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:13:57,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:13:57,507 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:58,110 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2022-07-23 06:13:58,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 06:13:58,111 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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 62 [2022-07-23 06:13:58,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:58,112 INFO L225 Difference]: With dead ends: 126 [2022-07-23 06:13:58,112 INFO L226 Difference]: Without dead ends: 126 [2022-07-23 06:13:58,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-07-23 06:13:58,112 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 166 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:58,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 472 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 249 Invalid, 0 Unknown, 13 Unchecked, 0.4s Time] [2022-07-23 06:13:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-23 06:13:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2022-07-23 06:13:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.175257731958763) internal successors, (114), 105 states have internal predecessors, (114), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:13:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2022-07-23 06:13:58,116 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 62 [2022-07-23 06:13:58,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:58,116 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2022-07-23 06:13:58,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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,117 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2022-07-23 06:13:58,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-23 06:13:58,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:58,117 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, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:58,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-23 06:13:58,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:13:58,318 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:58,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:58,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1507930724, now seen corresponding path program 1 times [2022-07-23 06:13:58,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:58,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577646116] [2022-07-23 06:13:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:58,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:58,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:58,322 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:13:58,325 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:13:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:13:58,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-23 06:13:58,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:13:59,154 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,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:13:59,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:13:59,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577646116] [2022-07-23 06:13:59,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577646116] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:13:59,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:13:59,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-23 06:13:59,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663680184] [2022-07-23 06:13:59,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:13:59,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:13:59,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:13:59,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:13:59,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:13:59,157 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 14 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 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,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:13:59,606 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2022-07-23 06:13:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 06:13:59,607 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 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 65 [2022-07-23 06:13:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:13:59,608 INFO L225 Difference]: With dead ends: 121 [2022-07-23 06:13:59,608 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 06:13:59,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-07-23 06:13:59,609 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 207 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:13:59,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 432 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 189 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2022-07-23 06:13:59,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 06:13:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2022-07-23 06:13:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.1546391752577319) internal successors, (112), 104 states have internal predecessors, (112), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:13:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2022-07-23 06:13:59,612 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 65 [2022-07-23 06:13:59,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:13:59,613 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2022-07-23 06:13:59,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 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,613 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-07-23 06:13:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-23 06:13:59,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:13:59,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:13:59,630 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:13:59,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:13:59,814 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:13:59,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:13:59,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1701102758, now seen corresponding path program 1 times [2022-07-23 06:13:59,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:13:59,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058243427] [2022-07-23 06:13:59,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:13:59,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:13:59,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:13:59,818 INFO L229 MonitoredProcess]: Starting monitored process 28 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:59,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-23 06:14:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:14:00,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-23 06:14:00,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:14:00,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:00,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:00,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:00,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:00,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:00,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:00,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2022-07-23 06:14:05,162 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2050 (_ BitVec 8)) (v_ArrVal_2049 (_ BitVec 8))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2049) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2050)))) is different from true [2022-07-23 06:14:05,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:05,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:05,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:05,177 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 29 treesize of output 32 [2022-07-23 06:14:05,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:05,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:05,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:05,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:05,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:05,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:05,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:14:05,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:14:05,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 69 [2022-07-23 06:14:05,682 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:14:05,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 23 [2022-07-23 06:14:05,926 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:14:05,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:14:05,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:14:05,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058243427] [2022-07-23 06:14:05,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058243427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:14:05,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:14:05,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-07-23 06:14:05,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687868248] [2022-07-23 06:14:05,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:14:05,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-23 06:14:05,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:14:05,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-23 06:14:05,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=641, Unknown=2, NotChecked=50, Total=756 [2022-07-23 06:14:05,928 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 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:14:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:14:06,822 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2022-07-23 06:14:06,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-23 06:14:06,824 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 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 68 [2022-07-23 06:14:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:14:06,825 INFO L225 Difference]: With dead ends: 101 [2022-07-23 06:14:06,825 INFO L226 Difference]: Without dead ends: 101 [2022-07-23 06:14:06,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=136, Invalid=1198, Unknown=2, NotChecked=70, Total=1406 [2022-07-23 06:14:06,826 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 36 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:14:06,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1084 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 258 Invalid, 0 Unknown, 343 Unchecked, 0.5s Time] [2022-07-23 06:14:06,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-23 06:14:06,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-23 06:14:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 92 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:14:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2022-07-23 06:14:06,829 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 68 [2022-07-23 06:14:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:14:06,829 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2022-07-23 06:14:06,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 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:14:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2022-07-23 06:14:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 06:14:06,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:14:06,830 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, 1, 1] [2022-07-23 06:14:06,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-23 06:14:07,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:14:07,039 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:14:07,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:14:07,039 INFO L85 PathProgramCache]: Analyzing trace with hash -756328715, now seen corresponding path program 1 times [2022-07-23 06:14:07,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:14:07,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768525752] [2022-07-23 06:14:07,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:14:07,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:14:07,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:14:07,041 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:07,042 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:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:14:07,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 06:14:07,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:14:07,368 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:07,530 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:07,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:14:07,689 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:07,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:14:07,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768525752] [2022-07-23 06:14:07,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768525752] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:14:07,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:14:07,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-07-23 06:14:07,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160712162] [2022-07-23 06:14:07,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:14:07,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:14:07,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:14:07,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:14:07,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:14:07,692 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand has 13 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 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:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:14:07,982 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-07-23 06:14:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:14:07,983 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 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 70 [2022-07-23 06:14:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:14:07,984 INFO L225 Difference]: With dead ends: 107 [2022-07-23 06:14:07,984 INFO L226 Difference]: Without dead ends: 107 [2022-07-23 06:14:07,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:14:07,986 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 108 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:14:07,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 363 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 200 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-07-23 06:14:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-23 06:14:07,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2022-07-23 06:14:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 91 states have internal predecessors, (94), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:14:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-07-23 06:14:07,995 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 70 [2022-07-23 06:14:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:14:07,995 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-07-23 06:14:07,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 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:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-07-23 06:14:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 06:14:07,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:14:07,996 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:14:08,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-23 06:14:08,211 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:08,211 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:14:08,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:14:08,212 INFO L85 PathProgramCache]: Analyzing trace with hash 681881017, now seen corresponding path program 1 times [2022-07-23 06:14:08,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:14:08,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876448771] [2022-07-23 06:14:08,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:14:08,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:14:08,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:14:08,214 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:08,215 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:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:14:08,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 06:14:08,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:14:08,610 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:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:14:08,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:14:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-23 06:14:08,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:14:08,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876448771] [2022-07-23 06:14:08,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876448771] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:14:08,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:14:08,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2022-07-23 06:14:08,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087958548] [2022-07-23 06:14:08,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:14:08,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:14:08,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:14:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:14:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:14:08,958 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 14 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 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:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:14:09,365 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2022-07-23 06:14:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 06:14:09,365 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 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 76 [2022-07-23 06:14:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:14:09,367 INFO L225 Difference]: With dead ends: 106 [2022-07-23 06:14:09,367 INFO L226 Difference]: Without dead ends: 106 [2022-07-23 06:14:09,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:14:09,368 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 91 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:14:09,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 441 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 51 Unchecked, 0.3s Time] [2022-07-23 06:14:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-23 06:14:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2022-07-23 06:14:09,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 90 states have internal predecessors, (93), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:14:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2022-07-23 06:14:09,371 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 76 [2022-07-23 06:14:09,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:14:09,372 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2022-07-23 06:14:09,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 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:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2022-07-23 06:14:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 06:14:09,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:14:09,373 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:14:09,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-23 06:14:09,587 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:09,588 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:14:09,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:14:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash 681881018, now seen corresponding path program 1 times [2022-07-23 06:14:09,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:14:09,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898042401] [2022-07-23 06:14:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:14:09,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:14:09,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:14:09,590 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:09,591 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:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:14:10,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-23 06:14:10,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:14:10,088 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:10,508 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:10,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:14:10,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:14:10,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898042401] [2022-07-23 06:14:10,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898042401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:14:10,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:14:10,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-23 06:14:10,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487910799] [2022-07-23 06:14:10,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:14:10,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:14:10,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:14:10,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:14:10,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:14:10,510 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 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:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:14:10,940 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2022-07-23 06:14:10,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:14:10,941 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 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 76 [2022-07-23 06:14:10,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:14:10,941 INFO L225 Difference]: With dead ends: 101 [2022-07-23 06:14:10,941 INFO L226 Difference]: Without dead ends: 101 [2022-07-23 06:14:10,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:14:10,942 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 92 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:14:10,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 512 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 17 Unchecked, 0.3s Time] [2022-07-23 06:14:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-23 06:14:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2022-07-23 06:14:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 88 states have internal predecessors, (91), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:14:10,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2022-07-23 06:14:10,945 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 76 [2022-07-23 06:14:10,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:14:10,946 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2022-07-23 06:14:10,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 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:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2022-07-23 06:14:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-23 06:14:10,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:14:10,947 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-07-23 06:14:10,969 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:11,163 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:11,164 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:14:11,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:14:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1200120414, now seen corresponding path program 1 times [2022-07-23 06:14:11,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:14:11,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114380391] [2022-07-23 06:14:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:14:11,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:14:11,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:14:11,166 INFO L229 MonitoredProcess]: Starting monitored process 32 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:11,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-23 06:14:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:14:11,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-23 06:14:11,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:14:11,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:11,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:11,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:11,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:11,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:11,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:11,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:11,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:11,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:11,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:14:11,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:14:11,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2022-07-23 06:14:16,684 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2734 (_ BitVec 8)) (v_ArrVal_2733 (_ BitVec 8))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2733) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2734)))) is different from true [2022-07-23 06:14:16,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:16,718 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:14:16,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 71 [2022-07-23 06:14:17,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:14:17,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:14:17,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:14:17,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:14:17,135 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:14:17,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 193 treesize of output 165 [2022-07-23 06:14:17,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:17,897 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:14:17,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 137 [2022-07-23 06:14:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-07-23 06:14:22,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:14:34,803 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))))) (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select |c_#memory_int| |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32))))) is different from false [2022-07-23 06:14:36,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))))) (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (store (store (store (store (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32)) ((_ extract 15 8) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) ((_ extract 23 16) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32)) ((_ extract 31 24) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32))))) is different from false [2022-07-23 06:14:39,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (let ((.cse5 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_#t~mem28#1| (bvneg |c_ldv_kobject_put_ldv_atomic_sub_return_~i#1|)))) (store (store (store (store (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) .cse5)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32)) ((_ extract 15 8) .cse5)) (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) ((_ extract 23 16) .cse5)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32)) ((_ extract 31 24) .cse5)))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32)) (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse6 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse12 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse11 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse7 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse9 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse7 .cse12) (select .cse7 .cse11)) (select .cse7 .cse10)) (select .cse7 .cse8))))) (store (store (store (store .cse7 .cse8 ((_ extract 7 0) .cse9)) .cse10 ((_ extract 15 8) .cse9)) .cse11 ((_ extract 23 16) .cse9)) .cse12 ((_ extract 31 24) .cse9))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse6 .cse1) (select .cse6 .cse2)) (select .cse6 .cse3)) (select .cse6 .cse4))))))))) is different from false [2022-07-23 06:14:41,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))))) (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (let ((.cse16 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32))) (.cse15 (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|)) (.cse14 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32))) (.cse12 (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|))) (let ((.cse13 (bvadd (bvneg |c_ldv_kobject_put_ldv_atomic_sub_return_~i#1|) (concat (concat (concat (select .cse12 .cse16) (select .cse12 .cse15)) (select .cse12 .cse14)) (select .cse12 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|))))) (store (store (store (store .cse12 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) .cse13)) .cse14 ((_ extract 15 8) .cse13)) .cse15 ((_ extract 23 16) .cse13)) .cse16 ((_ extract 31 24) .cse13))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32))))) is different from false [2022-07-23 06:14:43,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv14 32))) (.cse8 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_#memory_int| |c_ldv_kobject_put_~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6)) (_ bv4294967295 32)))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32)) (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse17 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse16 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse15 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse12 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse13 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse14 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse12 .cse17) (select .cse12 .cse16)) (select .cse12 .cse15)) (select .cse12 .cse13))))) (store (store (store (store .cse12 .cse13 ((_ extract 7 0) .cse14)) .cse15 ((_ extract 15 8) .cse14)) .cse16 ((_ extract 23 16) .cse14)) .cse17 ((_ extract 31 24) .cse14))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4))))))))) is different from false [2022-07-23 06:14:45,187 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32))) (.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (or (= (bvadd (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse5 (select |c_#memory_int| |c_ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4))) (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse12 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse13 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse12 .cse10) (select .cse12 .cse9)) (select .cse12 .cse8)) (select .cse12 .cse6))))) (store (store (store (store .cse12 .cse6 ((_ extract 7 0) .cse13)) .cse8 ((_ extract 15 8) .cse13)) .cse9 ((_ extract 23 16) .cse13)) .cse10 ((_ extract 31 24) .cse13))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4))))))))) is different from false [2022-07-23 06:14:48,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:14:48,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114380391] [2022-07-23 06:14:48,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114380391] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:14:48,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2112215031] [2022-07-23 06:14:48,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:14:48,131 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:14:48,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:14:48,133 INFO L229 MonitoredProcess]: Starting monitored process 33 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:48,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-07-23 06:14:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:14:50,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 139 conjunts are in the unsatisfiable core [2022-07-23 06:14:50,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:14:51,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:51,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:51,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:51,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:51,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:51,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:51,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:51,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:51,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:51,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:14:51,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:14:51,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2022-07-23 06:14:54,047 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2733 (_ BitVec 8)) (v_ArrVal_2937 (_ BitVec 8))) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2733) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2937)) |c_#memory_int|)) is different from true [2022-07-23 06:14:54,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,079 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:14:54,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 71 [2022-07-23 06:14:54,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:14:54,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:14:54,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:14:54,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:14:54,239 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:14:54,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 193 treesize of output 165 [2022-07-23 06:14:54,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:14:54,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:14:54,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 137 [2022-07-23 06:14:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-23 06:14:54,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:14:57,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv15 32))) (.cse2 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv14 32))) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv12 32)))) (or (not (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32))) (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select |c_#memory_int| |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32))))) is different from false [2022-07-23 06:14:59,782 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv15 32))) (.cse2 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv14 32))) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv12 32)))) (or (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (store (store (store (store (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32)) ((_ extract 15 8) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) ((_ extract 23 16) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32)) ((_ extract 31 24) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32)) (not (= (bvadd (_ bv4294967295 32) (let ((.cse5 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse11 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse10 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse9 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse6 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse7 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse8 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse6 .cse11) (select .cse6 .cse10)) (select .cse6 .cse9)) (select .cse6 .cse7))))) (store (store (store (store .cse6 .cse7 ((_ extract 7 0) .cse8)) .cse9 ((_ extract 15 8) .cse8)) .cse10 ((_ extract 23 16) .cse8)) .cse11 ((_ extract 31 24) .cse8))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse5 .cse1) (select .cse5 .cse2)) (select .cse5 .cse3)) (select .cse5 .cse4)))) (_ bv0 32)))))) is different from false [2022-07-23 06:15:01,859 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv15 32))) (.cse2 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv14 32))) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv12 32)))) (or (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (let ((.cse5 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_#t~mem28#1| (bvneg |c_ldv_kobject_put_ldv_atomic_sub_return_~i#1|)))) (store (store (store (store (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) .cse5)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32)) ((_ extract 15 8) .cse5)) (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) ((_ extract 23 16) .cse5)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32)) ((_ extract 31 24) .cse5)))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32)) (not (= (bvadd (_ bv4294967295 32) (let ((.cse6 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse12 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse11 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse7 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse9 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse7 .cse12) (select .cse7 .cse11)) (select .cse7 .cse10)) (select .cse7 .cse8))))) (store (store (store (store .cse7 .cse8 ((_ extract 7 0) .cse9)) .cse10 ((_ extract 15 8) .cse9)) .cse11 ((_ extract 23 16) .cse9)) .cse12 ((_ extract 31 24) .cse9))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse6 .cse1) (select .cse6 .cse2)) (select .cse6 .cse3)) (select .cse6 .cse4)))) (_ bv0 32)))))) is different from false [2022-07-23 06:15:03,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv15 32))) (.cse2 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv14 32))) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv12 32)))) (or (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (let ((.cse9 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32))) (.cse8 (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|)) (.cse7 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32))) (.cse5 (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|))) (let ((.cse6 (bvadd (bvneg |c_ldv_kobject_put_ldv_atomic_sub_return_~i#1|) (concat (concat (concat (select .cse5 .cse9) (select .cse5 .cse8)) (select .cse5 .cse7)) (select .cse5 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|))))) (store (store (store (store .cse5 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) .cse6)) .cse7 ((_ extract 15 8) .cse6)) .cse8 ((_ extract 23 16) .cse6)) .cse9 ((_ extract 31 24) .cse6))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32)) (not (= (bvadd (_ bv4294967295 32) (let ((.cse10 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse16 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse15 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse14 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse11 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse12 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse13 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse11 .cse16) (select .cse11 .cse15)) (select .cse11 .cse14)) (select .cse11 .cse12))))) (store (store (store (store .cse11 .cse12 ((_ extract 7 0) .cse13)) .cse14 ((_ extract 15 8) .cse13)) .cse15 ((_ extract 23 16) .cse13)) .cse16 ((_ extract 31 24) .cse13))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse10 .cse1) (select .cse10 .cse2)) (select .cse10 .cse3)) (select .cse10 .cse4)))) (_ bv0 32)))))) is different from false [2022-07-23 06:15:05,975 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv15 32))) (.cse2 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv14 32))) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv12 32)))) (or (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv14 32))) (.cse8 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_#memory_int| |c_ldv_kobject_put_~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6)) (_ bv4294967295 32)))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4))))) (not (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse17 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse16 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse15 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse12 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse13 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse14 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse12 .cse17) (select .cse12 .cse16)) (select .cse12 .cse15)) (select .cse12 .cse13))))) (store (store (store (store .cse12 .cse13 ((_ extract 7 0) .cse14)) .cse15 ((_ extract 15 8) .cse14)) .cse16 ((_ extract 23 16) .cse14)) .cse17 ((_ extract 31 24) .cse14))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32)))))) is different from false [2022-07-23 06:15:08,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv15 32))) (.cse2 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv14 32))) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv12 32))) (.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (or (not (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse5 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32))) (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_#memory_int| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse12 (select |c_#memory_int| |c_ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse13 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse12 .cse10) (select .cse12 .cse9)) (select .cse12 .cse8)) (select .cse12 .cse6))))) (store (store (store (store .cse12 .cse6 ((_ extract 7 0) .cse13)) .cse8 ((_ extract 15 8) .cse13)) .cse9 ((_ extract 23 16) .cse13)) .cse10 ((_ extract 31 24) .cse13))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32))))) is different from false [2022-07-23 06:15:08,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2112215031] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:15:08,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:15:08,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 44] total 45 [2022-07-23 06:15:08,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209385173] [2022-07-23 06:15:08,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:15:08,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-23 06:15:08,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:15:08,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-23 06:15:08,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3362, Unknown=21, NotChecked=1806, Total=5402 [2022-07-23 06:15:08,725 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 43 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:15:13,047 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2733 (_ BitVec 8)) (v_ArrVal_2937 (_ BitVec 8))) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2733) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2937)) |c_#memory_int|)) (exists ((v_ArrVal_2734 (_ BitVec 8)) (v_ArrVal_2733 (_ BitVec 8))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2733) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2734))))) is different from true [2022-07-23 06:15:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:15:35,736 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-07-23 06:15:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-23 06:15:35,737 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 43 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 81 [2022-07-23 06:15:35,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:15:35,738 INFO L225 Difference]: With dead ends: 101 [2022-07-23 06:15:35,738 INFO L226 Difference]: Without dead ends: 97 [2022-07-23 06:15:35,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 171 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 74.5s TimeCoverageRelationStatistics Valid=519, Invalid=6828, Unknown=23, NotChecked=2730, Total=10100 [2022-07-23 06:15:35,741 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 113 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:15:35,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1202 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1540 Invalid, 0 Unknown, 252 Unchecked, 3.1s Time] [2022-07-23 06:15:35,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-23 06:15:35,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-23 06:15:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 88 states have internal predecessors, (90), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:15:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-07-23 06:15:35,744 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 81 [2022-07-23 06:15:35,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:15:35,745 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-07-23 06:15:35,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 43 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:15:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-07-23 06:15:35,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-23 06:15:35,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:15:35,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:15:35,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-23 06:15:35,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2022-07-23 06:15:36,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-23 06:15:36,159 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:15:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:15:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2126857693, now seen corresponding path program 1 times [2022-07-23 06:15:36,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:15:36,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963448886] [2022-07-23 06:15:36,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:15:36,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:15:36,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:15:36,162 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:15:36,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-23 06:15:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:15:36,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 164 conjunts are in the unsatisfiable core [2022-07-23 06:15:36,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:15:36,834 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:15:36,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:36,874 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:15:36,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:36,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 22 treesize of output 21 [2022-07-23 06:15:36,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:36,964 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:15:37,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,022 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:15:37,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,071 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:15:37,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,126 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:15:37,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,175 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:15:37,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,229 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:15:37,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,285 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:15:37,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,347 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:15:37,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,404 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:15:37,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,461 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:15:37,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,527 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:15:37,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,593 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:15:37,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,656 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:15:37,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:37,905 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:15:43,089 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3169 (_ BitVec 32)) (v_ArrVal_3172 (_ 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_3169) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3172)) |c_#memory_$Pointer$.offset|)) is different from true [2022-07-23 06:15:43,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:43,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:43,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:43,103 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:15:43,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:43,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:43,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:43,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:43,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:43,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:43,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:43,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:43,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:43,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:43,336 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:15:45,641 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3179 (_ BitVec 32)) (v_ArrVal_3178 (_ BitVec 32)) (v_ArrVal_3180 (_ BitVec 32)) (v_ArrVal_3181 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3180) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3181) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3178) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3179)))) is different from true [2022-07-23 06:15:45,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,713 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:15:45,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:45,932 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:15:46,067 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:15:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-23 06:15:46,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:15:47,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:15:47,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963448886] [2022-07-23 06:15:47,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963448886] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:15:47,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1820578487] [2022-07-23 06:15:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:15:47,586 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:15:47,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:15:47,587 INFO L229 MonitoredProcess]: Starting monitored process 35 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:15:47,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-07-23 06:15:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:15:48,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 161 conjunts are in the unsatisfiable core [2022-07-23 06:15:48,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:15:48,438 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:15:48,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,457 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:15:48,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,487 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:15:48,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,502 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:15:48,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,549 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:15:48,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,588 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:15:48,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,629 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:15:48,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,678 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:15:48,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,695 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:15:48,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,751 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:15:48,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,792 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:15:48,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,808 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:15:48,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,832 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:15:48,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,868 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:15:48,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,908 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:15:48,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,948 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:15:48,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:48,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:49,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:49,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:49,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:49,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:49,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:49,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:49,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:49,005 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:15:51,106 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3411 (_ 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| |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3411)))) is different from true [2022-07-23 06:15:51,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,119 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 28 treesize of output 31 [2022-07-23 06:15:51,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:51,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:15:51,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 57 [2022-07-23 06:15:53,735 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3421 (_ BitVec 32)) (v_ArrVal_3420 (_ BitVec 32)) (v_ArrVal_3418 (_ BitVec 32)) (v_ArrVal_3419 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3420) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3421) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3418) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3419)))) is different from true [2022-07-23 06:15:53,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:53,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:53,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:53,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:53,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:53,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:53,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:53,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:53,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:53,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:53,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:53,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:53,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:53,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:15:53,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:15:53,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 57 [2022-07-23 06:15:54,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:15:54,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 49 [2022-07-23 06:15:54,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:15:54,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 26 [2022-07-23 06:15:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-23 06:15:54,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:15:56,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1820578487] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:15:56,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:15:56,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 46] total 60 [2022-07-23 06:15:56,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917295152] [2022-07-23 06:15:56,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:15:56,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-23 06:15:56,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:15:56,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-23 06:15:56,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=5003, Unknown=5, NotChecked=580, Total=5852 [2022-07-23 06:15:56,659 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 61 states, 58 states have (on average 1.896551724137931) internal successors, (110), 57 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:16:02,154 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3169 (_ BitVec 32)) (v_ArrVal_3172 (_ 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_3169) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3172)) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3411 (_ 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| |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3411))))) is different from true [2022-07-23 06:16:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:11,311 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-07-23 06:16:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-23 06:16:11,312 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 58 states have (on average 1.896551724137931) internal successors, (110), 57 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 82 [2022-07-23 06:16:11,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:11,312 INFO L225 Difference]: With dead ends: 96 [2022-07-23 06:16:11,313 INFO L226 Difference]: Without dead ends: 96 [2022-07-23 06:16:11,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 114 SyntacticMatches, 9 SemanticMatches, 107 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2847 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=554, Invalid=10171, Unknown=7, NotChecked=1040, Total=11772 [2022-07-23 06:16:11,315 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 206 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 2660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:11,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1185 Invalid, 2660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2181 Invalid, 0 Unknown, 420 Unchecked, 4.4s Time] [2022-07-23 06:16:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-23 06:16:11,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-23 06:16:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 87 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:16:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2022-07-23 06:16:11,318 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 82 [2022-07-23 06:16:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:11,318 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2022-07-23 06:16:11,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 58 states have (on average 1.896551724137931) internal successors, (110), 57 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:16:11,318 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-07-23 06:16:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 06:16:11,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:11,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:11,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-07-23 06:16:11,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2022-07-23 06:16:11,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-23 06:16:11,724 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:16:11,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1508079198, now seen corresponding path program 1 times [2022-07-23 06:16:11,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:16:11,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736793946] [2022-07-23 06:16:11,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:11,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:16:11,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:16:11,726 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:16:11,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-23 06:16:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:12,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 164 conjunts are in the unsatisfiable core [2022-07-23 06:16:12,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:16:12,394 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:16:12,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:12,426 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:16:12,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:12,464 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:16:12,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:12,494 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:16:12,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:12,529 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:16:12,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:12,566 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:16:12,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:12,614 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:16:12,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:12,662 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:16:12,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:12,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 21 treesize of output 20 [2022-07-23 06:16:12,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:12,752 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:16:12,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:12,818 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:16:12,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:12,900 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:16:12,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:12,955 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:16:13,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:13,002 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:16:13,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:13,055 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:16:13,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:13,115 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:16:13,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:13,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:13,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:13,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:13,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:13,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:13,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:13,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:13,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:13,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:13,311 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:16:18,520 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3650 (_ BitVec 32)) (v_ArrVal_3651 (_ 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_3650) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3651)) |c_#memory_$Pointer$.base|)) is different from true [2022-07-23 06:16:18,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:18,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:18,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:18,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, 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:16:18,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:18,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:18,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:18,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:18,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:18,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:18,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:18,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:18,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:18,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:18,706 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:16:20,945 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3661 (_ BitVec 32)) (v_ArrVal_3662 (_ BitVec 32)) (v_ArrVal_3658 (_ BitVec 32)) (v_ArrVal_3659 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3658) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3659) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3661) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3662)) |c_#memory_$Pointer$.base|)) is different from true [2022-07-23 06:16:20,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,008 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:16:21,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:21,208 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:16:21,312 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:16:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-23 06:16:21,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:16:23,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:16:23,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736793946] [2022-07-23 06:16:23,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736793946] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:16:23,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2036003974] [2022-07-23 06:16:23,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:23,078 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:16:23,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:16:23,079 INFO L229 MonitoredProcess]: Starting monitored process 37 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:16:23,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-07-23 06:16:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:23,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 160 conjunts are in the unsatisfiable core [2022-07-23 06:16:23,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:16:23,959 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:16:23,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:23,988 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:16:24,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,007 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:16:24,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,051 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:16:24,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,081 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:16:24,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,114 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:16:24,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,162 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:16:24,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,177 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:16:24,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,212 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:16:24,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,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 22 treesize of output 21 [2022-07-23 06:16:24,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,244 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:16:24,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,282 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:16:24,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,329 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:16:24,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,366 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:16:24,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,381 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:16:24,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,397 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:16:24,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:24,454 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:16:28,036 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3650 (_ BitVec 32)) (v_ArrVal_3891 (_ 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_3650) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3891)))) is different from true [2022-07-23 06:16:28,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:28,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:28,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:28,050 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:16:28,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:28,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:28,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:28,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:28,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:28,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:28,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:28,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:28,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:28,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:28,109 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:16:30,203 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3902 (_ BitVec 32)) (v_ArrVal_3900 (_ BitVec 32)) (v_ArrVal_3901 (_ BitVec 32)) (v_ArrVal_3898 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3902) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3900) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3901) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3898)) |c_#memory_$Pointer$.base|)) is different from true [2022-07-23 06:16:30,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:30,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:30,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:30,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:30,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:30,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:30,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:30,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:30,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:30,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:30,263 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:16:30,413 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:16:30,593 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:16:30,593 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:16:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-23 06:16:30,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:16:32,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2036003974] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:16:32,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:16:32,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47] total 53 [2022-07-23 06:16:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995234080] [2022-07-23 06:16:32,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:16:32,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-23 06:16:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:16:32,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-23 06:16:32,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3450, Unknown=5, NotChecked=484, Total=4160 [2022-07-23 06:16:32,790 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 53 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 50 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-23 06:16:37,187 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3650 (_ BitVec 32)) (v_ArrVal_3891 (_ 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_3650) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3891)))) (exists ((v_ArrVal_3650 (_ BitVec 32)) (v_ArrVal_3651 (_ 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_3650) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3651)) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 06:16:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:44,848 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-07-23 06:16:44,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-23 06:16:44,854 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 50 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 83 [2022-07-23 06:16:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:44,855 INFO L225 Difference]: With dead ends: 92 [2022-07-23 06:16:44,855 INFO L226 Difference]: Without dead ends: 91 [2022-07-23 06:16:44,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 129 SyntacticMatches, 10 SemanticMatches, 80 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1628 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=392, Invalid=5473, Unknown=7, NotChecked=770, Total=6642 [2022-07-23 06:16:44,857 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 132 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 2078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:44,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 796 Invalid, 2078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1639 Invalid, 0 Unknown, 389 Unchecked, 3.0s Time] [2022-07-23 06:16:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-23 06:16:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-23 06:16:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:16:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2022-07-23 06:16:44,859 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 83 [2022-07-23 06:16:44,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:44,860 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2022-07-23 06:16:44,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 50 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-23 06:16:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-07-23 06:16:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-23 06:16:44,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:44,861 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:44,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2022-07-23 06:16:45,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-07-23 06:16:45,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:16:45,264 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-23 06:16:45,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:45,264 INFO L85 PathProgramCache]: Analyzing trace with hash 102095468, now seen corresponding path program 1 times [2022-07-23 06:16:45,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:16:45,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70004977] [2022-07-23 06:16:45,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:45,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:16:45,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:16:45,266 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:16:45,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-23 06:16:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:45,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-23 06:16:45,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:16:46,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2022-07-23 06:16:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-23 06:16:46,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:16:51,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:16:51,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70004977] [2022-07-23 06:16:51,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70004977] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:16:51,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1247144050] [2022-07-23 06:16:51,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:51,136 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:16:51,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:16:51,138 INFO L229 MonitoredProcess]: Starting monitored process 39 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:16:51,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-07-23 06:16:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:52,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 06:16:52,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:16:52,469 INFO L356 Elim1Store]: treesize reduction 16, result has 42.9 percent of original size [2022-07-23 06:16:52,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-23 06:16:52,810 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-23 06:16:52,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:16:57,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1247144050] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:16:57,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:16:57,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2022-07-23 06:16:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422231282] [2022-07-23 06:16:57,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:16:57,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 06:16:57,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:16:57,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 06:16:57,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=721, Unknown=2, NotChecked=0, Total=812 [2022-07-23 06:16:57,392 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand has 20 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-23 06:16:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:57,631 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-07-23 06:16:57,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:16:57,631 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 90 [2022-07-23 06:16:57,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:57,632 INFO L225 Difference]: With dead ends: 90 [2022-07-23 06:16:57,632 INFO L226 Difference]: Without dead ends: 0 [2022-07-23 06:16:57,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 314 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=117, Invalid=937, Unknown=2, NotChecked=0, Total=1056 [2022-07-23 06:16:57,633 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:57,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 491 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 155 Unchecked, 0.2s Time] [2022-07-23 06:16:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-23 06:16:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-23 06:16:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-23 06:16:57,634 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2022-07-23 06:16:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:57,634 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 06:16:57,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-23 06:16:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-23 06:16:57,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-23 06:16:57,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 25 remaining) [2022-07-23 06:16:57,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2022-07-23 06:16:57,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2022-07-23 06:16:57,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 25 remaining) [2022-07-23 06:16:57,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 25 remaining) [2022-07-23 06:16:57,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 25 remaining) [2022-07-23 06:16:57,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 25 remaining) [2022-07-23 06:16:57,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 25 remaining) [2022-07-23 06:16:57,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (16 of 25 remaining) [2022-07-23 06:16:57,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 25 remaining) [2022-07-23 06:16:57,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 25 remaining) [2022-07-23 06:16:57,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 25 remaining) [2022-07-23 06:16:57,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 25 remaining) [2022-07-23 06:16:57,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 25 remaining) [2022-07-23 06:16:57,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 25 remaining) [2022-07-23 06:16:57,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 25 remaining) [2022-07-23 06:16:57,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 25 remaining) [2022-07-23 06:16:57,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 25 remaining) [2022-07-23 06:16:57,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 25 remaining) [2022-07-23 06:16:57,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 25 remaining) [2022-07-23 06:16:57,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 25 remaining) [2022-07-23 06:16:57,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 25 remaining) [2022-07-23 06:16:57,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 25 remaining) [2022-07-23 06:16:57,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 25 remaining) [2022-07-23 06:16:57,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 25 remaining) [2022-07-23 06:16:57,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-07-23 06:16:57,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2022-07-23 06:16:58,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-23 06:16:58,063 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, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:58,066 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-23 06:16:58,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 06:16:58 BoogieIcfgContainer [2022-07-23 06:16:58,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-23 06:16:58,069 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 06:16:58,069 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 06:16:58,070 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 06:16:58,070 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:38" (3/4) ... [2022-07-23 06:16:58,073 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-23 06:16:58,080 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-23 06:16:58,080 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-07-23 06:16:58,080 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-07-23 06:16:58,090 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2022-07-23 06:16:58,090 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-23 06:16:58,091 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-23 06:16:58,091 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-23 06:16:58,136 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-23 06:16:58,136 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 06:16:58,137 INFO L158 Benchmark]: Toolchain (without parser) took 200704.58ms. Allocated memory was 52.4MB in the beginning and 117.4MB in the end (delta: 65.0MB). Free memory was 27.6MB in the beginning and 40.1MB in the end (delta: -12.5MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2022-07-23 06:16:58,137 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 52.4MB. Free memory was 34.3MB in the beginning and 34.3MB in the end (delta: 38.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:16:58,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 704.35ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 27.4MB in the beginning and 40.9MB in the end (delta: -13.5MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-07-23 06:16:58,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.24ms. Allocated memory is still 65.0MB. Free memory was 40.7MB in the beginning and 38.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-23 06:16:58,138 INFO L158 Benchmark]: Boogie Preprocessor took 51.24ms. Allocated memory is still 65.0MB. Free memory was 38.0MB in the beginning and 36.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 06:16:58,138 INFO L158 Benchmark]: RCFGBuilder took 657.98ms. Allocated memory is still 65.0MB. Free memory was 35.8MB in the beginning and 28.0MB in the end (delta: 7.7MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-07-23 06:16:58,138 INFO L158 Benchmark]: TraceAbstraction took 199129.93ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 40.7MB in the beginning and 44.1MB in the end (delta: -3.4MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2022-07-23 06:16:58,139 INFO L158 Benchmark]: Witness Printer took 67.46ms. Allocated memory is still 117.4MB. Free memory was 44.1MB in the beginning and 40.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-23 06:16:58,140 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.29ms. Allocated memory is still 52.4MB. Free memory was 34.3MB in the beginning and 34.3MB in the end (delta: 38.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 704.35ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 27.4MB in the beginning and 40.9MB in the end (delta: -13.5MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.24ms. Allocated memory is still 65.0MB. Free memory was 40.7MB in the beginning and 38.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.24ms. Allocated memory is still 65.0MB. Free memory was 38.0MB in the beginning and 36.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 657.98ms. Allocated memory is still 65.0MB. Free memory was 35.8MB in the beginning and 28.0MB in the end (delta: 7.7MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * TraceAbstraction took 199129.93ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 40.7MB in the beginning and 44.1MB in the end (delta: -3.4MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. * Witness Printer took 67.46ms. Allocated memory is still 117.4MB. Free memory was 44.1MB in the beginning and 40.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 770]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 199.1s, OverallIterations: 34, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 62.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2820 SdHoareTripleChecker+Valid, 16.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2797 mSDsluCounter, 18034 SdHoareTripleChecker+Invalid, 14.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1777 IncrementalHoareTripleChecker+Unchecked, 15430 mSDsCounter, 387 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9880 IncrementalHoareTripleChecker+Invalid, 12044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 387 mSolverCounterUnsat, 2604 mSDtfsCounter, 9880 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2515 GetRequests, 1804 SyntacticMatches, 39 SemanticMatches, 672 ConstructedPredicates, 26 IntricatePredicates, 4 DeprecatedPredicates, 7192 ImplicationChecksByTransitivity, 146.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=25, InterpolantAutomatonStates: 459, 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, 34 MinimizatonAttempts, 351 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 7.7s SatisfiabilityAnalysisTime, 115.7s InterpolantComputationTime, 1832 NumberOfCodeBlocks, 1802 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2000 ConstructedInterpolants, 241 QuantifiedInterpolants, 21007 SizeOfPredicates, 898 NumberOfNonLiveVariables, 11729 ConjunctsInSsa, 1540 ConjunctsInUnsatCore, 43 InterpolantComputations, 25 PerfectInterpolantSequences, 3103/3985 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 - AllSpecificationsHoldResult: All specifications hold 25 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-23 06:16:58,290 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 Result: TRUE