./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 eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-eb692b5 [2022-07-20 05:59:24,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:59:24,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:59:24,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:59:24,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:59:24,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:59:24,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:59:24,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:59:24,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:59:24,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:59:24,567 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:59:24,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:59:24,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:59:24,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:59:24,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:59:24,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:59:24,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:59:24,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:59:24,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:59:24,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:59:24,578 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:59:24,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:59:24,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:59:24,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:59:24,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:59:24,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:59:24,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:59:24,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:59:24,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:59:24,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:59:24,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:59:24,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:59:24,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:59:24,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:59:24,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:59:24,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:59:24,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:59:24,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:59:24,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:59:24,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:59:24,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:59:24,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:59:24,594 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:59:24,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:59:24,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:59:24,613 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:59:24,613 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:59:24,614 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:59:24,614 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:59:24,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:59:24,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:59:24,615 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:59:24,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:59:24,616 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:59:24,616 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:59:24,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:59:24,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:59:24,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:59:24,617 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:59:24,617 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:59:24,617 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:59:24,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:59:24,618 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:59:24,618 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:59:24,618 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:59:24,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:59:24,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:59:24,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:59:24,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:59:24,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:59:24,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:59:24,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:59:24,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:59:24,620 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-20 05:59:24,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:59:24,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:59:24,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:59:24,907 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:59:24,908 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:59:24,910 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-20 05:59:24,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02632bf71/22af3aad910d4156a7eb23c0f5d6fb33/FLAG1a700f958 [2022-07-20 05:59:25,459 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:59:25,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-07-20 05:59:25,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02632bf71/22af3aad910d4156a7eb23c0f5d6fb33/FLAG1a700f958 [2022-07-20 05:59:25,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02632bf71/22af3aad910d4156a7eb23c0f5d6fb33 [2022-07-20 05:59:25,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:59:25,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:59:25,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:59:25,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:59:25,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:59:25,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:59:25" (1/1) ... [2022-07-20 05:59:25,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1314d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:25, skipping insertion in model container [2022-07-20 05:59:25,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:59:25" (1/1) ... [2022-07-20 05:59:25,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:59:26,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:59:26,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:59:26,381 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-20 05:59:26,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6c7aa0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:26, skipping insertion in model container [2022-07-20 05:59:26,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:59:26,383 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-20 05:59:26,385 INFO L158 Benchmark]: Toolchain (without parser) took 427.96ms. Allocated memory is still 92.3MB. Free memory was 58.7MB in the beginning and 64.3MB in the end (delta: -5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 05:59:26,386 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 92.3MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:59:26,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.67ms. Allocated memory is still 92.3MB. Free memory was 58.5MB in the beginning and 64.3MB in the end (delta: -5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 05:59:26,389 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 92.3MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.67ms. Allocated memory is still 92.3MB. Free memory was 58.5MB in the beginning and 64.3MB in the end (delta: -5.8MB). Peak memory consumption was 6.3MB. 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-?-eb692b5 [2022-07-20 05:59:28,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:59:28,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:59:28,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:59:28,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:59:28,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:59:28,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:59:28,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:59:28,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:59:28,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:59:28,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:59:28,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:59:28,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:59:28,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:59:28,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:59:28,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:59:28,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:59:28,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:59:28,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:59:28,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:59:28,289 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:59:28,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:59:28,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:59:28,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:59:28,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:59:28,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:59:28,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:59:28,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:59:28,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:59:28,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:59:28,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:59:28,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:59:28,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:59:28,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:59:28,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:59:28,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:59:28,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:59:28,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:59:28,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:59:28,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:59:28,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:59:28,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:59:28,316 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 05:59:28,356 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:59:28,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:59:28,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:59:28,358 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:59:28,359 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:59:28,359 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:59:28,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:59:28,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:59:28,360 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:59:28,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:59:28,361 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:59:28,362 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:59:28,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:59:28,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:59:28,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:59:28,362 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:59:28,363 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:59:28,363 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:59:28,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:59:28,363 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:59:28,363 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 05:59:28,364 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 05:59:28,364 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:59:28,364 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:59:28,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:59:28,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:59:28,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:59:28,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:59:28,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:59:28,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:59:28,366 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 05:59:28,366 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 05:59:28,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 05:59:28,366 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-20 05:59:28,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:59:28,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:59:28,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:59:28,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:59:28,694 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:59:28,697 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-20 05:59:28,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10e1ffa28/9dd60eee265c4300a37c6d3fe3cae880/FLAG2b3b89dcc [2022-07-20 05:59:29,339 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:59:29,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-07-20 05:59:29,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10e1ffa28/9dd60eee265c4300a37c6d3fe3cae880/FLAG2b3b89dcc [2022-07-20 05:59:29,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10e1ffa28/9dd60eee265c4300a37c6d3fe3cae880 [2022-07-20 05:59:29,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:59:29,738 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:59:29,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:59:29,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:59:29,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:59:29,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:59:29" (1/1) ... [2022-07-20 05:59:29,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e43e274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:29, skipping insertion in model container [2022-07-20 05:59:29,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:59:29" (1/1) ... [2022-07-20 05:59:29,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:59:29,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:59:30,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:59:30,171 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 05:59:30,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:59:30,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:59:30,264 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:59:30,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:59:30,382 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:59:30,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:30 WrapperNode [2022-07-20 05:59:30,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:59:30,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:59:30,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:59:30,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:59:30,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:30" (1/1) ... [2022-07-20 05:59:30,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:30" (1/1) ... [2022-07-20 05:59:30,457 INFO L137 Inliner]: procedures = 167, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 124 [2022-07-20 05:59:30,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:59:30,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:59:30,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:59:30,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:59:30,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:30" (1/1) ... [2022-07-20 05:59:30,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:30" (1/1) ... [2022-07-20 05:59:30,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:30" (1/1) ... [2022-07-20 05:59:30,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:30" (1/1) ... [2022-07-20 05:59:30,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:30" (1/1) ... [2022-07-20 05:59:30,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:30" (1/1) ... [2022-07-20 05:59:30,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:30" (1/1) ... [2022-07-20 05:59:30,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:59:30,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:59:30,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:59:30,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:59:30,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:30" (1/1) ... [2022-07-20 05:59:30,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:59:30,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:59:30,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 05:59:30,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 05:59:30,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 05:59:30,600 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-07-20 05:59:30,600 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-07-20 05:59:30,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 05:59:30,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 05:59:30,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-07-20 05:59:30,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-07-20 05:59:30,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:59:30,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:59:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:59:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:59:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 05:59:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:59:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 05:59:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:59:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:59:30,761 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:59:30,763 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:59:31,106 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:59:31,115 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:59:31,116 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 05:59:31,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:59:31 BoogieIcfgContainer [2022-07-20 05:59:31,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:59:31,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:59:31,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:59:31,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:59:31,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:59:29" (1/3) ... [2022-07-20 05:59:31,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5570f20b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:59:31, skipping insertion in model container [2022-07-20 05:59:31,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:30" (2/3) ... [2022-07-20 05:59:31,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5570f20b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:59:31, skipping insertion in model container [2022-07-20 05:59:31,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:59:31" (3/3) ... [2022-07-20 05:59:31,131 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2022-07-20 05:59:31,145 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:59:31,145 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-07-20 05:59:31,189 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:59:31,195 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@465fd383, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7db98d6c [2022-07-20 05:59:31,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-07-20 05:59:31,206 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-20 05:59:31,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:59:31,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:31,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:31,215 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-20 05:59:31,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:31,220 INFO L85 PathProgramCache]: Analyzing trace with hash 886333963, now seen corresponding path program 1 times [2022-07-20 05:59:31,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:31,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487565494] [2022-07-20 05:59:31,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:31,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:31,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:31,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:31,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 05:59:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:31,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:59:31,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:31,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:31,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:31,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:31,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:31,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487565494] [2022-07-20 05:59:31,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487565494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:31,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:31,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:59:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579713070] [2022-07-20 05:59:31,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:31,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:59:31,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:31,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:59:31,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:59:31,518 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-20 05:59:31,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:31,896 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2022-07-20 05:59:31,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:59:31,900 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-20 05:59:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:31,911 INFO L225 Difference]: With dead ends: 158 [2022-07-20 05:59:31,912 INFO L226 Difference]: Without dead ends: 156 [2022-07-20 05:59:31,914 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-20 05:59:31,926 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-20 05:59:31,928 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-20 05:59:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-20 05:59:31,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 95. [2022-07-20 05:59:31,971 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-20 05:59:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2022-07-20 05:59:31,983 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 10 [2022-07-20 05:59:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:31,983 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2022-07-20 05:59:31,984 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-20 05:59:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2022-07-20 05:59:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:59:31,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:31,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:32,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:32,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:32,199 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-20 05:59:32,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:32,201 INFO L85 PathProgramCache]: Analyzing trace with hash 914963114, now seen corresponding path program 1 times [2022-07-20 05:59:32,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:32,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047954166] [2022-07-20 05:59:32,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:32,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:32,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:32,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:32,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 05:59:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:32,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:59:32,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:32,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:32,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:32,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047954166] [2022-07-20 05:59:32,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047954166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:32,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:32,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:59:32,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717863599] [2022-07-20 05:59:32,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:32,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:59:32,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:32,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:59:32,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:59:32,380 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-20 05:59:32,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:32,428 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-07-20 05:59:32,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:59:32,429 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-20 05:59:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:32,433 INFO L225 Difference]: With dead ends: 114 [2022-07-20 05:59:32,433 INFO L226 Difference]: Without dead ends: 114 [2022-07-20 05:59:32,434 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-20 05:59:32,435 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-20 05:59:32,435 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-20 05:59:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-20 05:59:32,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2022-07-20 05:59:32,441 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-20 05:59:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2022-07-20 05:59:32,442 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 10 [2022-07-20 05:59:32,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:32,442 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2022-07-20 05:59:32,443 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-20 05:59:32,443 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2022-07-20 05:59:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:59:32,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:32,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:32,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:32,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:32,656 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-20 05:59:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1706549126, now seen corresponding path program 1 times [2022-07-20 05:59:32,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:32,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147200119] [2022-07-20 05:59:32,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:32,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:32,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:32,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:32,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 05:59:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:32,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:59:32,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:32,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:32,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:32,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:32,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147200119] [2022-07-20 05:59:32,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147200119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:32,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:32,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:59:32,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163986862] [2022-07-20 05:59:32,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:32,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:59:32,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:32,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:59:32,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:59:32,860 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-20 05:59:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:33,262 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-07-20 05:59:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:59:33,263 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-20 05:59:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:33,264 INFO L225 Difference]: With dead ends: 134 [2022-07-20 05:59:33,264 INFO L226 Difference]: Without dead ends: 134 [2022-07-20 05:59:33,265 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-20 05:59:33,266 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-20 05:59:33,266 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-20 05:59:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-20 05:59:33,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 92. [2022-07-20 05:59:33,272 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-20 05:59:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-07-20 05:59:33,273 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 11 [2022-07-20 05:59:33,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:33,273 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-07-20 05:59:33,274 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-20 05:59:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-07-20 05:59:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:59:33,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:33,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:33,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-20 05:59:33,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:33,483 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-20 05:59:33,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:33,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1363388625, now seen corresponding path program 1 times [2022-07-20 05:59:33,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:33,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156658184] [2022-07-20 05:59:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:33,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:33,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:33,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:33,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 05:59:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:33,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:59:33,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:33,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:33,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:33,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156658184] [2022-07-20 05:59:33,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156658184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:33,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:33,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:59:33,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603273026] [2022-07-20 05:59:33,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:33,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:59:33,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:33,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:59:33,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:59:33,572 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-20 05:59:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:33,590 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2022-07-20 05:59:33,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:59:33,591 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-20 05:59:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:33,592 INFO L225 Difference]: With dead ends: 113 [2022-07-20 05:59:33,592 INFO L226 Difference]: Without dead ends: 113 [2022-07-20 05:59:33,592 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-20 05:59:33,593 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-20 05:59:33,593 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-20 05:59:33,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-20 05:59:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2022-07-20 05:59:33,598 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-20 05:59:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-07-20 05:59:33,599 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 12 [2022-07-20 05:59:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:33,599 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-07-20 05:59:33,599 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-20 05:59:33,599 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-07-20 05:59:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:59:33,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:33,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:33,616 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-20 05:59:33,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:33,809 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-20 05:59:33,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1188768336, now seen corresponding path program 1 times [2022-07-20 05:59:33,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:33,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147161319] [2022-07-20 05:59:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:33,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:33,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:33,818 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:33,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 05:59:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:33,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:59:33,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:33,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:33,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:33,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147161319] [2022-07-20 05:59:33,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147161319] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:33,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:33,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:59:33,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019820805] [2022-07-20 05:59:33,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:33,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:59:33,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:59:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:59:33,925 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-20 05:59:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:33,955 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2022-07-20 05:59:33,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:59:33,956 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-20 05:59:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:33,956 INFO L225 Difference]: With dead ends: 112 [2022-07-20 05:59:33,957 INFO L226 Difference]: Without dead ends: 112 [2022-07-20 05:59:33,957 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-20 05:59:33,961 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-20 05:59:33,962 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-20 05:59:33,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-20 05:59:33,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2022-07-20 05:59:33,980 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-20 05:59:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2022-07-20 05:59:33,983 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 12 [2022-07-20 05:59:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:33,984 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2022-07-20 05:59:33,985 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-20 05:59:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-07-20 05:59:33,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:59:33,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:33,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:33,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-20 05:59:34,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:34,195 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-20 05:59:34,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:34,195 INFO L85 PathProgramCache]: Analyzing trace with hash 86428473, now seen corresponding path program 1 times [2022-07-20 05:59:34,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:34,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422116158] [2022-07-20 05:59:34,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:34,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:34,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:34,197 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:34,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 05:59:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:34,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 05:59:34,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:34,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:34,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:34,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422116158] [2022-07-20 05:59:34,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422116158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:34,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:34,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:59:34,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167967103] [2022-07-20 05:59:34,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:34,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:59:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:34,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:59:34,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:59:34,273 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-20 05:59:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:34,297 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-07-20 05:59:34,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:59:34,298 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-20 05:59:34,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:34,299 INFO L225 Difference]: With dead ends: 104 [2022-07-20 05:59:34,299 INFO L226 Difference]: Without dead ends: 104 [2022-07-20 05:59:34,299 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-20 05:59:34,300 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-20 05:59:34,300 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-20 05:59:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-20 05:59:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2022-07-20 05:59:34,304 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-20 05:59:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-07-20 05:59:34,304 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 16 [2022-07-20 05:59:34,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:34,304 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-07-20 05:59:34,305 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-20 05:59:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-07-20 05:59:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:59:34,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:34,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:34,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:34,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:34,515 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-20 05:59:34,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:34,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1674943760, now seen corresponding path program 1 times [2022-07-20 05:59:34,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:34,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578511748] [2022-07-20 05:59:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:34,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:34,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:34,517 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:34,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 05:59:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:34,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:59:34,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:34,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:59:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:34,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:34,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578511748] [2022-07-20 05:59:34,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578511748] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:59:34,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:59:34,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 05:59:34,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518089704] [2022-07-20 05:59:34,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:59:34,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:59:34,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:34,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:59:34,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:59:34,676 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-20 05:59:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:34,738 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-07-20 05:59:34,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:59:34,739 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-20 05:59:34,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:34,740 INFO L225 Difference]: With dead ends: 107 [2022-07-20 05:59:34,740 INFO L226 Difference]: Without dead ends: 107 [2022-07-20 05:59:34,740 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-20 05:59:34,741 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-20 05:59:34,741 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-20 05:59:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-20 05:59:34,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2022-07-20 05:59:34,745 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-20 05:59:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2022-07-20 05:59:34,745 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 17 [2022-07-20 05:59:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:34,746 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2022-07-20 05:59:34,746 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-20 05:59:34,746 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-07-20 05:59:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:59:34,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:34,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:34,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:34,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:34,954 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-20 05:59:34,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:34,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1276371002, now seen corresponding path program 1 times [2022-07-20 05:59:34,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:34,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129690087] [2022-07-20 05:59:34,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:34,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:34,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:34,957 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:34,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 05:59:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:35,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:59:35,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:35,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:35,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:35,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129690087] [2022-07-20 05:59:35,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129690087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:35,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:35,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:59:35,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103756898] [2022-07-20 05:59:35,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:35,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:59:35,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:35,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:59:35,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:59:35,109 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-20 05:59:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:35,192 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-07-20 05:59:35,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:59:35,193 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-20 05:59:35,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:35,194 INFO L225 Difference]: With dead ends: 113 [2022-07-20 05:59:35,194 INFO L226 Difference]: Without dead ends: 113 [2022-07-20 05:59:35,194 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-20 05:59:35,195 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-20 05:59:35,195 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-20 05:59:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-20 05:59:35,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-07-20 05:59:35,199 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-20 05:59:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2022-07-20 05:59:35,200 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 18 [2022-07-20 05:59:35,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:35,200 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2022-07-20 05:59:35,200 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-20 05:59:35,200 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-07-20 05:59:35,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:59:35,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:35,201 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:35,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:35,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:35,410 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-20 05:59:35,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:35,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1965719801, now seen corresponding path program 2 times [2022-07-20 05:59:35,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:35,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455232433] [2022-07-20 05:59:35,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:59:35,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:35,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:35,412 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:35,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-20 05:59:35,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 05:59:35,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:59:35,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:59:35,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:35,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:35,589 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-20 05:59:35,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:35,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:35,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455232433] [2022-07-20 05:59:35,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455232433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:35,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:35,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:59:35,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596590436] [2022-07-20 05:59:35,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:35,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:59:35,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:35,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:59:35,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:59:35,591 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-20 05:59:35,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:35,971 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-07-20 05:59:35,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:59:35,972 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-20 05:59:35,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:35,973 INFO L225 Difference]: With dead ends: 142 [2022-07-20 05:59:35,973 INFO L226 Difference]: Without dead ends: 142 [2022-07-20 05:59:35,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:59:35,974 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 95 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-20 05:59:35,974 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-20 05:59:35,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-20 05:59:35,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 107. [2022-07-20 05:59:35,978 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-20 05:59:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2022-07-20 05:59:35,979 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 20 [2022-07-20 05:59:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:35,979 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2022-07-20 05:59:35,979 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-20 05:59:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2022-07-20 05:59:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:59:35,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:35,980 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:35,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:36,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:36,189 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-20 05:59:36,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1965719802, now seen corresponding path program 1 times [2022-07-20 05:59:36,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:36,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399030095] [2022-07-20 05:59:36,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:36,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:36,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:36,192 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:36,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-20 05:59:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:36,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:59:36,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:36,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:59:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:36,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:36,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399030095] [2022-07-20 05:59:36,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399030095] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:59:36,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:59:36,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-20 05:59:36,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169382642] [2022-07-20 05:59:36,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:59:36,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 05:59:36,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:36,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 05:59:36,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:59:36,506 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-20 05:59:36,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:36,756 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-07-20 05:59:36,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:59:36,757 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-20 05:59:36,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:36,758 INFO L225 Difference]: With dead ends: 116 [2022-07-20 05:59:36,758 INFO L226 Difference]: Without dead ends: 116 [2022-07-20 05:59:36,758 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-20 05:59:36,759 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-20 05:59:36,759 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-20 05:59:36,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-20 05:59:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2022-07-20 05:59:36,762 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-20 05:59:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2022-07-20 05:59:36,764 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 20 [2022-07-20 05:59:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:36,765 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2022-07-20 05:59:36,765 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-20 05:59:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2022-07-20 05:59:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:59:36,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:36,767 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-20 05:59:36,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:36,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:36,967 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-20 05:59:36,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1184735654, now seen corresponding path program 1 times [2022-07-20 05:59:36,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:36,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874321599] [2022-07-20 05:59:36,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:36,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:36,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:36,969 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:36,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 05:59:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:37,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:59:37,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:37,077 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-20 05:59:37,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:37,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:37,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874321599] [2022-07-20 05:59:37,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874321599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:37,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:37,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:59:37,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136003700] [2022-07-20 05:59:37,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:37,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:59:37,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:37,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:59:37,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:59:37,079 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-20 05:59:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:37,218 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-07-20 05:59:37,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:59:37,218 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-20 05:59:37,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:37,219 INFO L225 Difference]: With dead ends: 119 [2022-07-20 05:59:37,219 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 05:59:37,219 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-20 05:59:37,220 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-20 05:59:37,220 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-20 05:59:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 05:59:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2022-07-20 05:59:37,223 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-20 05:59:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-07-20 05:59:37,223 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 27 [2022-07-20 05:59:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:37,224 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-07-20 05:59:37,224 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-20 05:59:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-07-20 05:59:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 05:59:37,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:37,224 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:37,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:37,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:37,433 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-20 05:59:37,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:37,434 INFO L85 PathProgramCache]: Analyzing trace with hash -103060070, now seen corresponding path program 2 times [2022-07-20 05:59:37,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:37,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294523609] [2022-07-20 05:59:37,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:59:37,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:37,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:37,436 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:37,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-20 05:59:37,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 05:59:37,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:59:37,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 05:59:37,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:37,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:37,700 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-20 05:59:37,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:37,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:37,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294523609] [2022-07-20 05:59:37,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294523609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:37,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:37,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:59:37,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015313861] [2022-07-20 05:59:37,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:37,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:59:37,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:37,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:59:37,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:59:37,702 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-20 05:59:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:38,218 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2022-07-20 05:59:38,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:59:38,219 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-20 05:59:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:38,220 INFO L225 Difference]: With dead ends: 141 [2022-07-20 05:59:38,220 INFO L226 Difference]: Without dead ends: 141 [2022-07-20 05:59:38,220 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-20 05:59:38,221 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 105 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-20 05:59:38,221 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-20 05:59:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-20 05:59:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2022-07-20 05:59:38,224 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-20 05:59:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-07-20 05:59:38,225 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2022-07-20 05:59:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:38,225 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-07-20 05:59:38,225 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-20 05:59:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-07-20 05:59:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:59:38,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:38,226 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-20 05:59:38,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:38,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:38,435 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-20 05:59:38,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:38,435 INFO L85 PathProgramCache]: Analyzing trace with hash -257987495, now seen corresponding path program 1 times [2022-07-20 05:59:38,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:38,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21685579] [2022-07-20 05:59:38,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:38,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:38,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:38,437 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:38,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-20 05:59:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:38,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:59:38,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:38,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:59:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:39,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:39,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21685579] [2022-07-20 05:59:39,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21685579] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:59:39,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:59:39,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-20 05:59:39,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288758976] [2022-07-20 05:59:39,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:59:39,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 05:59:39,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:39,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 05:59:39,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2022-07-20 05:59:39,188 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-20 05:59:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:39,642 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-07-20 05:59:39,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 05:59:39,643 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-20 05:59:39,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:39,644 INFO L225 Difference]: With dead ends: 102 [2022-07-20 05:59:39,644 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 05:59:39,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2022-07-20 05:59:39,645 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-20 05:59:39,645 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-20 05:59:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 05:59:39,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-20 05:59:39,648 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-20 05:59:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-07-20 05:59:39,648 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 28 [2022-07-20 05:59:39,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:39,648 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-07-20 05:59:39,649 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-20 05:59:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-07-20 05:59:39,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 05:59:39,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:39,649 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-20 05:59:39,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-20 05:59:39,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:39,861 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-20 05:59:39,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:39,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2039891719, now seen corresponding path program 2 times [2022-07-20 05:59:39,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:39,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065873495] [2022-07-20 05:59:39,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:59:39,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:39,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:39,863 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:39,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-20 05:59:39,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 05:59:39,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:59:39,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:59:39,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:40,025 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-20 05:59:40,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:40,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:40,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065873495] [2022-07-20 05:59:40,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065873495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:40,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:40,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:59:40,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829583249] [2022-07-20 05:59:40,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:40,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:59:40,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:40,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:59:40,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:59:40,028 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-20 05:59:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:40,060 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-07-20 05:59:40,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:59:40,061 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-20 05:59:40,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:40,064 INFO L225 Difference]: With dead ends: 102 [2022-07-20 05:59:40,064 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 05:59:40,064 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-20 05:59:40,065 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-20 05:59:40,065 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-20 05:59:40,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 05:59:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-20 05:59:40,069 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-20 05:59:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-07-20 05:59:40,070 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 34 [2022-07-20 05:59:40,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:40,070 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-07-20 05:59:40,070 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-20 05:59:40,071 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-07-20 05:59:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:59:40,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:40,075 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-20 05:59:40,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:40,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:40,285 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-20 05:59:40,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:40,285 INFO L85 PathProgramCache]: Analyzing trace with hash -382086172, now seen corresponding path program 1 times [2022-07-20 05:59:40,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:40,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104198794] [2022-07-20 05:59:40,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:40,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:40,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:40,287 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:40,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-20 05:59:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:40,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:59:40,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:40,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:40,580 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-20 05:59:40,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:40,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:40,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104198794] [2022-07-20 05:59:40,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104198794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:40,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:40,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:59:40,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335446086] [2022-07-20 05:59:40,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:40,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:59:40,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:40,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:59:40,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:59:40,582 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-20 05:59:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:40,883 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-07-20 05:59:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:59:40,883 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-20 05:59:40,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:40,884 INFO L225 Difference]: With dead ends: 100 [2022-07-20 05:59:40,884 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 05:59:40,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:59:40,885 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-20 05:59:40,885 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-20 05:59:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 05:59:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-20 05:59:40,888 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-20 05:59:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-07-20 05:59:40,888 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 36 [2022-07-20 05:59:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:40,889 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-07-20 05:59:40,889 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-20 05:59:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-07-20 05:59:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:59:40,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:40,890 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-20 05:59:40,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:41,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:41,100 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-20 05:59:41,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash -382086171, now seen corresponding path program 1 times [2022-07-20 05:59:41,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:41,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446089067] [2022-07-20 05:59:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:41,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:41,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:41,102 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:41,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-20 05:59:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:41,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 05:59:41,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:41,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:41,535 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-20 05:59:41,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:41,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:41,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446089067] [2022-07-20 05:59:41,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446089067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:41,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:41,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:59:41,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887466017] [2022-07-20 05:59:41,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:41,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:59:41,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:41,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:59:41,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:59:41,537 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-20 05:59:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:41,927 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-07-20 05:59:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:59:41,927 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-20 05:59:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:41,928 INFO L225 Difference]: With dead ends: 98 [2022-07-20 05:59:41,928 INFO L226 Difference]: Without dead ends: 98 [2022-07-20 05:59:41,929 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-20 05:59:41,929 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-20 05:59:41,929 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-20 05:59:41,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-20 05:59:41,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-20 05:59:41,932 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-20 05:59:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2022-07-20 05:59:41,932 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 36 [2022-07-20 05:59:41,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:41,933 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2022-07-20 05:59:41,933 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-20 05:59:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2022-07-20 05:59:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:59:41,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:41,933 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-20 05:59:41,945 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-20 05:59:42,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:42,145 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-20 05:59:42,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:42,145 INFO L85 PathProgramCache]: Analyzing trace with hash -432796251, now seen corresponding path program 1 times [2022-07-20 05:59:42,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:42,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164806351] [2022-07-20 05:59:42,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:42,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:42,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:42,147 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:42,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-20 05:59:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:42,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:59:42,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:42,360 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-20 05:59:42,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:42,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:42,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164806351] [2022-07-20 05:59:42,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164806351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:42,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:42,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:59:42,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590345759] [2022-07-20 05:59:42,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:42,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:59:42,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:42,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:59:42,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:59:42,363 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-20 05:59:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:42,416 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-07-20 05:59:42,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:59:42,417 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-20 05:59:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:42,418 INFO L225 Difference]: With dead ends: 98 [2022-07-20 05:59:42,418 INFO L226 Difference]: Without dead ends: 98 [2022-07-20 05:59:42,419 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-20 05:59:42,419 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-20 05:59:42,419 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-20 05:59:42,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-20 05:59:42,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-20 05:59:42,422 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-20 05:59:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2022-07-20 05:59:42,424 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 36 [2022-07-20 05:59:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:42,427 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2022-07-20 05:59:42,427 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-20 05:59:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-07-20 05:59:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 05:59:42,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:42,429 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-20 05:59:42,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:42,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:42,641 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-20 05:59:42,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:42,641 INFO L85 PathProgramCache]: Analyzing trace with hash 74876930, now seen corresponding path program 1 times [2022-07-20 05:59:42,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:42,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921396549] [2022-07-20 05:59:42,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:42,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:42,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:42,643 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:42,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-20 05:59:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:42,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 05:59:42,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:42,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:42,995 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-20 05:59:42,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:42,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:42,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921396549] [2022-07-20 05:59:42,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921396549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:42,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:42,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:59:42,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437246049] [2022-07-20 05:59:42,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:42,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:59:42,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:42,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:59:42,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:59:42,998 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-20 05:59:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:43,227 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-07-20 05:59:43,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:59:43,227 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-20 05:59:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:43,228 INFO L225 Difference]: With dead ends: 100 [2022-07-20 05:59:43,228 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 05:59:43,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:59:43,229 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-20 05:59:43,229 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-20 05:59:43,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 05:59:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-07-20 05:59:43,232 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-20 05:59:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2022-07-20 05:59:43,232 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 44 [2022-07-20 05:59:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:43,232 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2022-07-20 05:59:43,233 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-20 05:59:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-07-20 05:59:43,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 05:59:43,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:43,233 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-20 05:59:43,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:43,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:43,434 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-20 05:59:43,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash 74876931, now seen corresponding path program 1 times [2022-07-20 05:59:43,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:43,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605804617] [2022-07-20 05:59:43,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:43,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:43,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:43,436 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:43,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-20 05:59:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:43,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 05:59:43,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:43,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:43,917 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-20 05:59:43,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:43,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:43,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605804617] [2022-07-20 05:59:43,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605804617] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:43,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:43,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:59:43,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239515895] [2022-07-20 05:59:43,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:43,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:59:43,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:43,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:59:43,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:59:43,919 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-20 05:59:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:44,233 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-07-20 05:59:44,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:59:44,240 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-20 05:59:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:44,241 INFO L225 Difference]: With dead ends: 103 [2022-07-20 05:59:44,241 INFO L226 Difference]: Without dead ends: 103 [2022-07-20 05:59:44,241 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-20 05:59:44,242 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:44,242 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.2s Time] [2022-07-20 05:59:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-20 05:59:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2022-07-20 05:59:44,253 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-20 05:59:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2022-07-20 05:59:44,253 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 44 [2022-07-20 05:59:44,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:44,254 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2022-07-20 05:59:44,254 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-20 05:59:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-07-20 05:59:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 05:59:44,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:44,254 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-20 05:59:44,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:44,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:44,464 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-20 05:59:44,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:44,464 INFO L85 PathProgramCache]: Analyzing trace with hash 496438540, now seen corresponding path program 1 times [2022-07-20 05:59:44,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:44,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473392671] [2022-07-20 05:59:44,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:44,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:44,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:44,466 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:44,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-20 05:59:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:44,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 05:59:44,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:44,781 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-20 05:59:44,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:44,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:44,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473392671] [2022-07-20 05:59:44,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473392671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:44,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:44,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:59:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141561941] [2022-07-20 05:59:44,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:44,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:59:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:59:44,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:59:44,784 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-20 05:59:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:44,837 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-07-20 05:59:44,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:59:44,838 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-20 05:59:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:44,838 INFO L225 Difference]: With dead ends: 94 [2022-07-20 05:59:44,838 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 05:59:44,839 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-20 05:59:44,839 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-20 05:59:44,839 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-20 05:59:44,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 05:59:44,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-20 05:59:44,841 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-20 05:59:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-07-20 05:59:44,842 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 50 [2022-07-20 05:59:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:44,842 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-07-20 05:59:44,842 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-20 05:59:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-07-20 05:59:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-20 05:59:44,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:44,843 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-20 05:59:44,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:45,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:45,047 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-20 05:59:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash -774905870, now seen corresponding path program 1 times [2022-07-20 05:59:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:45,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158425083] [2022-07-20 05:59:45,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:45,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:45,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:45,049 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:45,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-20 05:59:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:45,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 05:59:45,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:45,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:45,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-20 05:59:45,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:45,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:45,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158425083] [2022-07-20 05:59:45,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158425083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:45,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:45,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 05:59:45,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136208512] [2022-07-20 05:59:45,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:45,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:59:45,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:45,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:59:45,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:59:45,530 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-20 05:59:45,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:45,912 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2022-07-20 05:59:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:59:45,913 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-20 05:59:45,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:45,913 INFO L225 Difference]: With dead ends: 123 [2022-07-20 05:59:45,914 INFO L226 Difference]: Without dead ends: 123 [2022-07-20 05:59:45,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:59:45,914 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 138 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-20 05:59:45,915 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-20 05:59:45,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-20 05:59:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2022-07-20 05:59:45,918 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-20 05:59:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-07-20 05:59:45,918 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 56 [2022-07-20 05:59:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:45,919 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-07-20 05:59:45,919 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-20 05:59:45,919 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-07-20 05:59:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-20 05:59:45,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:45,920 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-20 05:59:45,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:46,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:46,121 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-20 05:59:46,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:46,121 INFO L85 PathProgramCache]: Analyzing trace with hash -774905869, now seen corresponding path program 1 times [2022-07-20 05:59:46,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:46,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809174891] [2022-07-20 05:59:46,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:46,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:46,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:46,123 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:46,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-20 05:59:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:46,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-20 05:59:46,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:46,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:46,749 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-20 05:59:46,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:46,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:46,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809174891] [2022-07-20 05:59:46,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809174891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:46,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:46,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 05:59:46,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311352502] [2022-07-20 05:59:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:46,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:59:46,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:46,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:59:46,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:59:46,752 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-20 05:59:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:47,162 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-07-20 05:59:47,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:59:47,163 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-20 05:59:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:47,164 INFO L225 Difference]: With dead ends: 111 [2022-07-20 05:59:47,164 INFO L226 Difference]: Without dead ends: 111 [2022-07-20 05:59:47,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:59:47,165 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-20 05:59:47,165 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-20 05:59:47,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-20 05:59:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2022-07-20 05:59:47,168 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-20 05:59:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2022-07-20 05:59:47,169 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 56 [2022-07-20 05:59:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:47,169 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2022-07-20 05:59:47,169 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-20 05:59:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2022-07-20 05:59:47,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-20 05:59:47,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:47,170 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-20 05:59:47,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:47,379 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-20 05:59:47,380 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-20 05:59:47,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:47,380 INFO L85 PathProgramCache]: Analyzing trace with hash -178952659, now seen corresponding path program 1 times [2022-07-20 05:59:47,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:47,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818204036] [2022-07-20 05:59:47,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:47,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:47,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:47,382 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-20 05:59:47,383 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-20 05:59:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:47,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 05:59:47,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:47,763 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-20 05:59:47,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:47,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:47,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818204036] [2022-07-20 05:59:47,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818204036] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:47,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:47,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 05:59:47,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524205112] [2022-07-20 05:59:47,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:47,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:59:47,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:47,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:59:47,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:59:47,765 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-20 05:59:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:47,880 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-07-20 05:59:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:59:47,880 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-20 05:59:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:47,881 INFO L225 Difference]: With dead ends: 111 [2022-07-20 05:59:47,881 INFO L226 Difference]: Without dead ends: 107 [2022-07-20 05:59:47,882 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-20 05:59:47,882 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-20 05:59:47,882 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-20 05:59:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-20 05:59:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-20 05:59:47,885 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-20 05:59:47,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2022-07-20 05:59:47,886 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 62 [2022-07-20 05:59:47,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:47,886 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2022-07-20 05:59:47,886 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-20 05:59:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-07-20 05:59:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-20 05:59:47,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:47,887 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-20 05:59:47,901 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-20 05:59:48,087 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-20 05:59:48,087 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-20 05:59:48,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:48,088 INFO L85 PathProgramCache]: Analyzing trace with hash 59491574, now seen corresponding path program 1 times [2022-07-20 05:59:48,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:48,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493373044] [2022-07-20 05:59:48,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:48,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:48,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:48,090 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:48,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-20 05:59:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:48,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 05:59:48,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:48,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:48,575 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-20 05:59:48,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:48,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:48,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493373044] [2022-07-20 05:59:48,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493373044] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:48,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:48,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 05:59:48,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971328569] [2022-07-20 05:59:48,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:48,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:59:48,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:48,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:59:48,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:59:48,577 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-20 05:59:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:49,033 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-07-20 05:59:49,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:59:49,034 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-20 05:59:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:49,035 INFO L225 Difference]: With dead ends: 116 [2022-07-20 05:59:49,035 INFO L226 Difference]: Without dead ends: 116 [2022-07-20 05:59:49,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:59:49,035 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:49,036 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.4s Time] [2022-07-20 05:59:49,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-20 05:59:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2022-07-20 05:59:49,038 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-20 05:59:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2022-07-20 05:59:49,039 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 62 [2022-07-20 05:59:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:49,039 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2022-07-20 05:59:49,039 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-20 05:59:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-07-20 05:59:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-20 05:59:49,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:49,040 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-20 05:59:49,056 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-20 05:59:49,240 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-20 05:59:49,241 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-20 05:59:49,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:49,241 INFO L85 PathProgramCache]: Analyzing trace with hash 59491575, now seen corresponding path program 1 times [2022-07-20 05:59:49,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:49,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107280580] [2022-07-20 05:59:49,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:49,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:49,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:49,244 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-20 05:59:49,246 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-20 05:59:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:49,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-20 05:59:49,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:49,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:49,989 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-20 05:59:49,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:49,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:49,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107280580] [2022-07-20 05:59:49,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107280580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:49,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:49,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-20 05:59:49,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747462000] [2022-07-20 05:59:49,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:49,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 05:59:49,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:49,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 05:59:49,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:59:49,991 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-20 05:59:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:50,506 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2022-07-20 05:59:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:59:50,507 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-20 05:59:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:50,508 INFO L225 Difference]: With dead ends: 126 [2022-07-20 05:59:50,508 INFO L226 Difference]: Without dead ends: 126 [2022-07-20 05:59:50,508 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-20 05:59:50,509 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 166 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-20 05:59:50,509 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-20 05:59:50,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-20 05:59:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2022-07-20 05:59:50,519 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-20 05:59:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2022-07-20 05:59:50,520 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 62 [2022-07-20 05:59:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:50,520 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2022-07-20 05:59:50,520 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-20 05:59:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2022-07-20 05:59:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-20 05:59:50,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:50,521 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-20 05:59:50,533 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-20 05:59:50,721 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-20 05:59:50,722 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-20 05:59:50,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:50,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1507930724, now seen corresponding path program 1 times [2022-07-20 05:59:50,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:50,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049877192] [2022-07-20 05:59:50,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:50,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:50,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:50,724 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-20 05:59:50,725 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-20 05:59:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:51,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 05:59:51,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:51,491 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-20 05:59:51,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:51,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:51,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049877192] [2022-07-20 05:59:51,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049877192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:51,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:51,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 05:59:51,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909461688] [2022-07-20 05:59:51,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:51,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 05:59:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:51,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 05:59:51,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:59:51,500 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-20 05:59:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:51,962 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2022-07-20 05:59:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:59:51,964 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-20 05:59:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:51,965 INFO L225 Difference]: With dead ends: 121 [2022-07-20 05:59:51,965 INFO L226 Difference]: Without dead ends: 121 [2022-07-20 05:59:51,965 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-20 05:59:51,965 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:51,966 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.3s Time] [2022-07-20 05:59:51,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-20 05:59:51,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2022-07-20 05:59:51,968 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-20 05:59:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2022-07-20 05:59:51,968 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 65 [2022-07-20 05:59:51,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:51,969 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2022-07-20 05:59:51,969 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-20 05:59:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-07-20 05:59:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-20 05:59:51,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:51,969 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-20 05:59:51,985 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-20 05:59:52,170 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-20 05:59:52,170 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-20 05:59:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1701102758, now seen corresponding path program 1 times [2022-07-20 05:59:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:52,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658941925] [2022-07-20 05:59:52,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:52,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:52,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:52,173 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-20 05:59:52,175 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-20 05:59:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:52,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-20 05:59:52,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:52,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,854 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-20 05:59:56,496 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-20 05:59:56,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:56,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:56,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:56,509 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-20 05:59:56,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:56,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:56,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:56,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:56,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:56,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:56,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:59:56,822 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:59:56,823 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-20 05:59:57,079 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:59:57,080 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-20 05:59:57,303 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-20 05:59:57,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:57,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:57,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658941925] [2022-07-20 05:59:57,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658941925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:57,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:57,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-07-20 05:59:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691183776] [2022-07-20 05:59:57,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:57,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 05:59:57,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:57,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 05:59:57,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=641, Unknown=2, NotChecked=50, Total=756 [2022-07-20 05:59:57,305 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-20 05:59:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:58,180 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2022-07-20 05:59:58,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-20 05:59:58,182 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-20 05:59:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:58,182 INFO L225 Difference]: With dead ends: 101 [2022-07-20 05:59:58,182 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 05:59:58,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=136, Invalid=1198, Unknown=2, NotChecked=70, Total=1406 [2022-07-20 05:59:58,183 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:58,184 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.4s Time] [2022-07-20 05:59:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 05:59:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-20 05:59:58,186 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-20 05:59:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2022-07-20 05:59:58,187 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 68 [2022-07-20 05:59:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:58,187 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2022-07-20 05:59:58,188 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-20 05:59:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2022-07-20 05:59:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-20 05:59:58,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:58,188 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-20 05:59:58,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-20 05:59:58,404 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-20 05:59:58,404 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-20 05:59:58,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash -756328715, now seen corresponding path program 1 times [2022-07-20 05:59:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:58,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350032237] [2022-07-20 05:59:58,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:58,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:58,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:58,406 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-20 05:59:58,408 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-20 05:59:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:58,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 05:59:58,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:58,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:58,971 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-20 05:59:58,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:59:59,145 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-20 05:59:59,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:59,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350032237] [2022-07-20 05:59:59,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350032237] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:59:59,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:59:59,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-07-20 05:59:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045096489] [2022-07-20 05:59:59,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:59:59,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:59:59,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:59,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:59:59,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:59:59,147 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-20 05:59:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:59,505 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-07-20 05:59:59,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:59:59,505 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-20 05:59:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:59,506 INFO L225 Difference]: With dead ends: 107 [2022-07-20 05:59:59,506 INFO L226 Difference]: Without dead ends: 107 [2022-07-20 05:59:59,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:59:59,507 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:59,507 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.3s Time] [2022-07-20 05:59:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-20 05:59:59,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2022-07-20 05:59:59,510 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-20 05:59:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-07-20 05:59:59,510 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 70 [2022-07-20 05:59:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:59,511 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-07-20 05:59:59,511 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-20 05:59:59,511 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-07-20 05:59:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 05:59:59,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:59,512 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-20 05:59:59,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:59,726 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-20 05:59:59,726 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-20 05:59:59,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:59,726 INFO L85 PathProgramCache]: Analyzing trace with hash 681881017, now seen corresponding path program 1 times [2022-07-20 05:59:59,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:59,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641643963] [2022-07-20 05:59:59,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:59,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:59,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:59,728 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-20 05:59:59,729 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-20 06:00:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:00:00,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 06:00:00,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:00:00,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:00:00,321 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-20 06:00:00,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:00:00,490 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-20 06:00:00,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:00:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641643963] [2022-07-20 06:00:00,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641643963] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:00:00,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:00:00,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2022-07-20 06:00:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77036653] [2022-07-20 06:00:00,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:00:00,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 06:00:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:00:00,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 06:00:00,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:00:00,492 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-20 06:00:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:00:00,856 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2022-07-20 06:00:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:00:00,856 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-20 06:00:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:00:00,857 INFO L225 Difference]: With dead ends: 106 [2022-07-20 06:00:00,857 INFO L226 Difference]: Without dead ends: 106 [2022-07-20 06:00:00,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-20 06:00:00,858 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-20 06:00:00,858 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-20 06:00:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-20 06:00:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2022-07-20 06:00:00,860 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-20 06:00:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2022-07-20 06:00:00,861 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 76 [2022-07-20 06:00:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:00:00,861 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2022-07-20 06:00:00,862 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-20 06:00:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2022-07-20 06:00:00,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 06:00:00,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:00:00,862 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-20 06:00:00,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-20 06:00:01,076 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-20 06:00:01,076 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-20 06:00:01,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:00:01,077 INFO L85 PathProgramCache]: Analyzing trace with hash 681881018, now seen corresponding path program 1 times [2022-07-20 06:00:01,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:00:01,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234632911] [2022-07-20 06:00:01,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:00:01,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:00:01,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:00:01,078 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-20 06:00:01,079 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-20 06:00:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:00:01,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-20 06:00:01,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:00:01,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:00:01,848 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-20 06:00:01,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:00:01,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:00:01,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234632911] [2022-07-20 06:00:01,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234632911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:00:01,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:00:01,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 06:00:01,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671632481] [2022-07-20 06:00:01,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:00:01,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 06:00:01,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:00:01,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 06:00:01,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:00:01,849 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-20 06:00:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:00:02,132 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2022-07-20 06:00:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 06:00:02,132 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-20 06:00:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:00:02,133 INFO L225 Difference]: With dead ends: 101 [2022-07-20 06:00:02,133 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 06:00:02,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-07-20 06:00:02,134 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 92 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:00:02,137 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.2s Time] [2022-07-20 06:00:02,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 06:00:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2022-07-20 06:00:02,140 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-20 06:00:02,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2022-07-20 06:00:02,140 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 76 [2022-07-20 06:00:02,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:00:02,140 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2022-07-20 06:00:02,141 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-20 06:00:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2022-07-20 06:00:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-20 06:00:02,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:00:02,142 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-20 06:00:02,157 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-20 06:00:02,356 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-20 06:00:02,357 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-20 06:00:02,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:00:02,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1200120414, now seen corresponding path program 1 times [2022-07-20 06:00:02,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:00:02,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160749947] [2022-07-20 06:00:02,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:00:02,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:00:02,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:00:02,359 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-20 06:00:02,359 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-20 06:00:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:00:02,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-20 06:00:02,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:00:03,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:03,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:03,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:03,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:03,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:03,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:03,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:03,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:03,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:03,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:03,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:03,053 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-20 06:00:07,300 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-20 06:00:07,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,327 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:00:07,327 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-20 06:00:07,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:07,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:07,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:07,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:07,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:07,745 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:00:07,746 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-20 06:00:08,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:08,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:08,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:08,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:08,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:08,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:08,481 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:00:08,481 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-20 06:00:13,137 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-20 06:00:13,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:00:25,248 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-20 06:00:27,429 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-20 06:00:29,473 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-20 06:00:31,570 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-20 06:00:33,613 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-20 06:00:35,659 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-20 06:00:38,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:00:38,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160749947] [2022-07-20 06:00:38,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160749947] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:00:38,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1365302160] [2022-07-20 06:00:38,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:00:38,636 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:00:38,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:00:38,638 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-20 06:00:38,639 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-20 06:00:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:00:41,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 139 conjunts are in the unsatisfiable core [2022-07-20 06:00:41,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:00:42,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:42,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:42,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:42,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:42,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:42,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:42,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:42,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:42,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:42,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:42,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:42,499 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-20 06:00:44,723 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-20 06:00:44,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,754 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:00:44,754 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-20 06:00:44,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:44,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:44,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:44,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:44,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:44,887 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:00:44,887 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-20 06:00:45,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:45,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:45,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:45,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:45,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:45,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:45,252 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:00:45,253 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-20 06:00:45,353 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-20 06:00:45,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:00:48,402 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-20 06:00:50,554 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-20 06:00:52,602 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-20 06:00:54,677 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-20 06:00:56,735 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-20 06:00:58,779 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-20 06:00:59,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1365302160] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:00:59,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:00:59,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 44] total 45 [2022-07-20 06:00:59,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667135229] [2022-07-20 06:00:59,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:00:59,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 06:00:59,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:00:59,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 06:00:59,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3362, Unknown=21, NotChecked=1806, Total=5402 [2022-07-20 06:00:59,399 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-20 06:01:03,518 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-20 06:01:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:01:26,785 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-07-20 06:01:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-20 06:01:26,786 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-20 06:01:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:01:26,787 INFO L225 Difference]: With dead ends: 101 [2022-07-20 06:01:26,787 INFO L226 Difference]: Without dead ends: 97 [2022-07-20 06:01:26,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 171 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 74.0s TimeCoverageRelationStatistics Valid=519, Invalid=6828, Unknown=23, NotChecked=2730, Total=10100 [2022-07-20 06:01:26,790 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-20 06:01:26,790 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-20 06:01:26,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-20 06:01:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-20 06:01:26,792 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-20 06:01:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-07-20 06:01:26,793 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 81 [2022-07-20 06:01:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:01:26,793 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-07-20 06:01:26,793 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-20 06:01:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-07-20 06:01:26,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-20 06:01:26,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:01:26,794 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-20 06:01:26,815 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-20 06:01:27,019 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-20 06:01:27,208 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-20 06:01:27,208 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-20 06:01:27,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:01:27,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2126857693, now seen corresponding path program 1 times [2022-07-20 06:01:27,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:01:27,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430598148] [2022-07-20 06:01:27,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:01:27,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:01:27,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:01:27,211 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-20 06:01:27,211 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-20 06:01:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:01:27,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 164 conjunts are in the unsatisfiable core [2022-07-20 06:01:27,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:01:27,881 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-20 06:01:27,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,912 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-20 06:01:27,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,950 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-20 06:01:27,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,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-20 06:01:28,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 06:01:28,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,078 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-20 06:01:28,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 06:01:28,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,167 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-20 06:01:28,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,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, 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-20 06:01:28,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,256 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-20 06:01:28,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,309 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-20 06:01:28,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,354 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-20 06:01:28,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,401 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-20 06:01:28,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,451 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-20 06:01:28,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,517 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-20 06:01:28,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,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 21 treesize of output 20 [2022-07-20 06:01:28,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:28,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, 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-20 06:01:33,964 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-20 06:01:33,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:33,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:33,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:33,980 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-20 06:01:34,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,182 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-20 06:01:36,410 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-20 06:01:36,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,466 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-20 06:01:36,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:36,653 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-20 06:01:36,751 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-20 06:01:36,829 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-20 06:01:36,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:01:38,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:01:38,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430598148] [2022-07-20 06:01:38,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430598148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:01:38,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [23710526] [2022-07-20 06:01:38,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:01:38,320 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:01:38,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:01:38,322 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-20 06:01:38,323 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-20 06:01:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:01:39,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 161 conjunts are in the unsatisfiable core [2022-07-20 06:01:39,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:01:39,254 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-20 06:01:39,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,287 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-20 06:01:39,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,312 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-20 06:01:39,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,326 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-20 06:01:39,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,358 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-20 06:01:39,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,398 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-20 06:01:39,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,437 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-20 06:01:39,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,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 21 treesize of output 20 [2022-07-20 06:01:39,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,506 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-20 06:01:39,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,573 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-20 06:01:39,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,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 22 treesize of output 21 [2022-07-20 06:01:39,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,633 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-20 06:01:39,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,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 22 treesize of output 21 [2022-07-20 06:01:39,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,694 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-20 06:01:39,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,736 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-20 06:01:39,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,793 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-20 06:01:39,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,856 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-20 06:01:41,975 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-20 06:01:41,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:41,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:41,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:41,986 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-20 06:01:42,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:42,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:42,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:42,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:42,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:42,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:42,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:42,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:42,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:42,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:42,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:42,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:42,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:42,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:42,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:01:42,365 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-20 06:01:44,601 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-20 06:01:44,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:44,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:44,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:44,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:44,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:44,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:44,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:44,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:44,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:44,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:44,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:44,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:44,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:44,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:44,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:01:44,674 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-20 06:01:44,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:01:44,925 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-20 06:01:45,069 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:01:45,069 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-20 06:01:45,211 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-20 06:01:45,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:01:47,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [23710526] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:01:47,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:01:47,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 46] total 60 [2022-07-20 06:01:47,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105425555] [2022-07-20 06:01:47,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:01:47,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-20 06:01:47,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:01:47,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-20 06:01:47,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=5003, Unknown=5, NotChecked=580, Total=5852 [2022-07-20 06:01:47,508 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-20 06:01:53,128 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-20 06:02:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:02:02,896 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-07-20 06:02:02,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-20 06:02:02,897 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-20 06:02:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:02:02,898 INFO L225 Difference]: With dead ends: 96 [2022-07-20 06:02:02,898 INFO L226 Difference]: Without dead ends: 96 [2022-07-20 06:02:02,901 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-20 06:02:02,902 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 206 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:02:02,902 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.8s Time] [2022-07-20 06:02:02,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-20 06:02:02,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-20 06:02:02,904 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-20 06:02:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2022-07-20 06:02:02,905 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 82 [2022-07-20 06:02:02,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:02:02,905 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2022-07-20 06:02:02,905 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-20 06:02:02,906 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-07-20 06:02:02,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-20 06:02:02,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:02:02,906 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-20 06:02:02,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-20 06:02:03,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-07-20 06:02:03,311 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-20 06:02:03,312 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-20 06:02:03,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:02:03,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1508079198, now seen corresponding path program 1 times [2022-07-20 06:02:03,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:02:03,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913577028] [2022-07-20 06:02:03,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:03,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:02:03,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:02:03,314 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-20 06:02:03,316 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-20 06:02:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:03,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 164 conjunts are in the unsatisfiable core [2022-07-20 06:02:03,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:02:04,071 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-20 06:02:04,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:04,123 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-20 06:02:04,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:04,202 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-20 06:02:04,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:04,248 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-20 06:02:04,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:04,304 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-20 06:02:04,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:04,358 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-20 06:02:04,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:04,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 21 treesize of output 20 [2022-07-20 06:02:04,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:04,484 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-20 06:02:04,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:04,559 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-20 06:02:04,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:04,608 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-20 06:02:04,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:04,676 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-20 06:02:04,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:04,738 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-20 06:02:04,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:04,811 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-20 06:02:04,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:04,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-20 06:02:04,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:04,949 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-20 06:02:05,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:05,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, 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-20 06:02:05,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:05,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:05,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:05,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:05,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:05,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:05,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:05,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:05,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:05,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:05,361 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-20 06:02:10,984 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-20 06:02:11,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:11,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:11,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:11,031 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-20 06:02:11,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:11,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:11,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:11,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:11,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:11,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:11,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:11,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:11,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:11,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:11,302 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-20 06:02:13,743 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-20 06:02:13,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,811 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-20 06:02:14,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 06:02:14,238 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-20 06:02:14,448 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-20 06:02:14,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:02:16,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:02:16,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913577028] [2022-07-20 06:02:16,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913577028] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:02:16,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1667451059] [2022-07-20 06:02:16,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:16,279 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:02:16,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:02:16,281 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-20 06:02:16,281 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-20 06:02:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:17,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 160 conjunts are in the unsatisfiable core [2022-07-20 06:02:17,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:02:17,270 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-20 06:02:17,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,306 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-20 06:02:17,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,331 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-20 06:02:17,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,377 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-20 06:02:17,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,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, 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-20 06:02:17,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,458 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-20 06:02:17,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,519 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-20 06:02:17,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,539 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-20 06:02:17,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,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 21 treesize of output 20 [2022-07-20 06:02:17,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,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 22 treesize of output 21 [2022-07-20 06:02:17,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,636 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-20 06:02:17,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,690 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-20 06:02:17,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,762 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-20 06:02:17,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,824 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-20 06:02:17,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,854 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-20 06:02:17,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,881 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-20 06:02:17,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,967 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-20 06:02:21,693 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-20 06:02:21,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:21,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:21,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:21,709 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-20 06:02:21,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:21,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:21,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:21,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:21,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:21,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:21,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:21,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:21,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:21,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:21,791 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-20 06:02:23,932 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-20 06:02:24,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:24,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:24,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:24,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:24,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:24,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:24,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:24,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:24,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:24,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:24,035 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-20 06:02:24,215 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-20 06:02:24,367 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:02:24,367 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-20 06:02:24,512 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-20 06:02:24,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:02:26,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1667451059] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:02:26,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:02:26,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47] total 53 [2022-07-20 06:02:26,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904287225] [2022-07-20 06:02:26,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:02:26,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-20 06:02:26,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:02:26,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-20 06:02:26,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3450, Unknown=5, NotChecked=484, Total=4160 [2022-07-20 06:02:26,480 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-20 06:02:31,266 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-20 06:02:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:02:39,189 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-07-20 06:02:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-20 06:02:39,190 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-20 06:02:39,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:02:39,191 INFO L225 Difference]: With dead ends: 92 [2022-07-20 06:02:39,191 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 06:02:39,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 129 SyntacticMatches, 10 SemanticMatches, 80 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1628 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=392, Invalid=5473, Unknown=7, NotChecked=770, Total=6642 [2022-07-20 06:02:39,192 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 132 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:02:39,193 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.5s Time] [2022-07-20 06:02:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 06:02:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-20 06:02:39,194 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-20 06:02:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2022-07-20 06:02:39,195 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 83 [2022-07-20 06:02:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:02:39,195 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2022-07-20 06:02:39,196 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-20 06:02:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-07-20 06:02:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-20 06:02:39,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:02:39,197 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-20 06:02:39,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2022-07-20 06:02:39,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-07-20 06:02:39,607 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-20 06:02:39,608 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-20 06:02:39,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:02:39,608 INFO L85 PathProgramCache]: Analyzing trace with hash 102095468, now seen corresponding path program 1 times [2022-07-20 06:02:39,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:02:39,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155587663] [2022-07-20 06:02:39,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:39,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:02:39,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:02:39,610 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-20 06:02:39,611 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-20 06:02:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:40,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 06:02:40,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:02:40,594 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-20 06:02:41,031 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-20 06:02:41,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:02:45,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:02:45,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155587663] [2022-07-20 06:02:45,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155587663] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:02:45,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [392107180] [2022-07-20 06:02:45,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:45,850 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:02:45,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:02:45,851 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-20 06:02:45,852 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-20 06:02:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:46,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 06:02:46,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:02:47,164 INFO L356 Elim1Store]: treesize reduction 16, result has 42.9 percent of original size [2022-07-20 06:02:47,164 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-20 06:02:47,570 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-20 06:02:47,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:02:52,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [392107180] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:02:52,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:02:52,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2022-07-20 06:02:52,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713633560] [2022-07-20 06:02:52,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:02:52,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 06:02:52,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:02:52,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 06:02:52,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=721, Unknown=2, NotChecked=0, Total=812 [2022-07-20 06:02:52,153 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-20 06:02:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:02:52,416 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-07-20 06:02:52,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 06:02:52,417 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-20 06:02:52,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:02:52,417 INFO L225 Difference]: With dead ends: 90 [2022-07-20 06:02:52,417 INFO L226 Difference]: Without dead ends: 0 [2022-07-20 06:02:52,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 314 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=117, Invalid=937, Unknown=2, NotChecked=0, Total=1056 [2022-07-20 06:02:52,418 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-20 06:02:52,418 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-20 06:02:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-20 06:02:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-20 06:02:52,419 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-20 06:02:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-20 06:02:52,419 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2022-07-20 06:02:52,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:02:52,419 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-20 06:02:52,419 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-20 06:02:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-20 06:02:52,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-20 06:02:52,422 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 25 remaining) [2022-07-20 06:02:52,422 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2022-07-20 06:02:52,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2022-07-20 06:02:52,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 25 remaining) [2022-07-20 06:02:52,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 25 remaining) [2022-07-20 06:02:52,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 25 remaining) [2022-07-20 06:02:52,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 25 remaining) [2022-07-20 06:02:52,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 25 remaining) [2022-07-20 06:02:52,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (16 of 25 remaining) [2022-07-20 06:02:52,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 25 remaining) [2022-07-20 06:02:52,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 25 remaining) [2022-07-20 06:02:52,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 25 remaining) [2022-07-20 06:02:52,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 25 remaining) [2022-07-20 06:02:52,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 25 remaining) [2022-07-20 06:02:52,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 25 remaining) [2022-07-20 06:02:52,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 25 remaining) [2022-07-20 06:02:52,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 25 remaining) [2022-07-20 06:02:52,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 25 remaining) [2022-07-20 06:02:52,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 25 remaining) [2022-07-20 06:02:52,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 25 remaining) [2022-07-20 06:02:52,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 25 remaining) [2022-07-20 06:02:52,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 25 remaining) [2022-07-20 06:02:52,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 25 remaining) [2022-07-20 06:02:52,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 25 remaining) [2022-07-20 06:02:52,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 25 remaining) [2022-07-20 06:02:52,445 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-20 06:02:52,648 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-20 06:02:52,839 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-20 06:02:52,842 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-20 06:02:52,844 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 06:02:52,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:02:52 BoogieIcfgContainer [2022-07-20 06:02:52,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 06:02:52,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 06:02:52,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 06:02:52,847 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 06:02:52,847 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:59:31" (3/4) ... [2022-07-20 06:02:52,849 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-20 06:02:52,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-20 06:02:52,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-07-20 06:02:52,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-07-20 06:02:52,862 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2022-07-20 06:02:52,863 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-20 06:02:52,863 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-20 06:02:52,863 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-20 06:02:52,910 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 06:02:52,910 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 06:02:52,911 INFO L158 Benchmark]: Toolchain (without parser) took 203172.61ms. Allocated memory was 48.2MB in the beginning and 88.1MB in the end (delta: 39.8MB). Free memory was 23.8MB in the beginning and 38.2MB in the end (delta: -14.4MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2022-07-20 06:02:52,913 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 48.2MB. Free memory was 30.3MB in the beginning and 30.2MB in the end (delta: 37.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:02:52,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 641.08ms. Allocated memory was 48.2MB in the beginning and 60.8MB in the end (delta: 12.6MB). Free memory was 23.6MB in the beginning and 38.0MB in the end (delta: -14.4MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-07-20 06:02:52,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.17ms. Allocated memory is still 60.8MB. Free memory was 37.9MB in the beginning and 35.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 06:02:52,919 INFO L158 Benchmark]: Boogie Preprocessor took 48.60ms. Allocated memory is still 60.8MB. Free memory was 35.2MB in the beginning and 32.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:02:52,919 INFO L158 Benchmark]: RCFGBuilder took 606.91ms. Allocated memory is still 60.8MB. Free memory was 32.9MB in the beginning and 25.1MB in the end (delta: 7.8MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2022-07-20 06:02:52,919 INFO L158 Benchmark]: TraceAbstraction took 201721.21ms. Allocated memory was 60.8MB in the beginning and 88.1MB in the end (delta: 27.3MB). Free memory was 38.3MB in the beginning and 42.6MB in the end (delta: -4.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-07-20 06:02:52,919 INFO L158 Benchmark]: Witness Printer took 63.59ms. Allocated memory is still 88.1MB. Free memory was 42.6MB in the beginning and 38.2MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 06:02:52,920 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.36ms. Allocated memory is still 48.2MB. Free memory was 30.3MB in the beginning and 30.2MB in the end (delta: 37.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 641.08ms. Allocated memory was 48.2MB in the beginning and 60.8MB in the end (delta: 12.6MB). Free memory was 23.6MB in the beginning and 38.0MB in the end (delta: -14.4MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.17ms. Allocated memory is still 60.8MB. Free memory was 37.9MB in the beginning and 35.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.60ms. Allocated memory is still 60.8MB. Free memory was 35.2MB in the beginning and 32.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 606.91ms. Allocated memory is still 60.8MB. Free memory was 32.9MB in the beginning and 25.1MB in the end (delta: 7.8MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * TraceAbstraction took 201721.21ms. Allocated memory was 60.8MB in the beginning and 88.1MB in the end (delta: 27.3MB). Free memory was 38.3MB in the beginning and 42.6MB in the end (delta: -4.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Witness Printer took 63.59ms. Allocated memory is still 88.1MB. Free memory was 42.6MB in the beginning and 38.2MB in the end (delta: 4.4MB). 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: 201.7s, OverallIterations: 34, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 64.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2820 SdHoareTripleChecker+Valid, 17.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2797 mSDsluCounter, 18034 SdHoareTripleChecker+Invalid, 15.3s 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, 1795 SyntacticMatches, 48 SemanticMatches, 672 ConstructedPredicates, 26 IntricatePredicates, 4 DeprecatedPredicates, 7196 ImplicationChecksByTransitivity, 146.2s 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, 8.2s SatisfiabilityAnalysisTime, 116.0s 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-20 06:02:53,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE